Topology for Computing
£72.00
Part of Cambridge Monographs on Applied and Computational Mathematics
- Author: Afra J. Zomorodian, Dartmouth College, New Hampshire
- Date Published: March 2005
- availability: Available
- format: Hardback
- isbn: 9780521836661
£
72.00
Hardback
Other available formats:
Paperback, eBook
Looking for an inspection copy?
This title is not currently available on inspection
-
The emerging field of computational topology utilizes theory from topology and the power of computing to solve problems in diverse fields. Recent applications include computer graphics, computer-aided design (CAD), and structural biology, all of which involve understanding the intrinsic shape of some real or abstract space. A primary goal of this book is to present basic concepts from topology and Morse theory to enable a non-specialist to grasp and participate in current research in computational topology. The author gives a self-contained presentation of the mathematical concepts from a computer scientist's point of view, combining point set topology, algebraic topology, group theory, differential manifolds, and Morse theory. He also presents some recent advances in the area, including topological persistence and hierarchical Morse complexes. Throughout, the focus is on computational challenges and on presenting algorithms and data structures when appropriate.
Read more- Presents classical topological subject of Morse theory in a computer science context
- Material is widely used within computation geometry and computer graphics
Reviews & endorsements
'In my knowledge, it is the first book covering these topics.' Numerical Algorithms
Customer reviews
Not yet reviewed
Be the first to review
Review was not posted due to profanity
×Product details
- Date Published: March 2005
- format: Hardback
- isbn: 9780521836661
- length: 258 pages
- dimensions: 229 x 152 x 16 mm
- weight: 0.52kg
- contains: 118 b/w illus. 2 colour illus.
- availability: Available
Table of Contents
1. Introduction
Part I. Mathematics:
2. Spaces and filtrations
3. Group theory
4. Homology
5. Morse theory
6. New results
Part II. Algorithms:
7. The persistence algorithms
8. Topological simplification
9. The Morse–Smale algorithm
10. The linking number algorithm
Part III. Applications:
11. Software
12. Experiments
13. Applications.
related journals
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org
Register Sign in» Proceed