Skip to content
Register Sign in Wishlist
Topology for Computing

Topology for Computing

$124.00 (C)

Part of Cambridge Monographs on Applied and Computational Mathematics

  • Date Published: January 2005
  • availability: Available
  • format: Hardback
  • isbn: 9780521836661

$ 124.00 (C)

Add to cart Add to wishlist

Other available formats:
Paperback, eBook

Looking for an examination copy?

If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact providing details of the course you are teaching.

Product filter button
About the Authors
  • Written by a computer scientist for computer scientists, this book teaches topology from a computational point of view, and shows how to solve real problems that have topological aspects involving computers. Such problems arise in many areas, such as computer graphics, robotics, structural biology, and chemistry. The author starts from the basics of topology, assuming no prior exposure to the subject, and moves rapidly up to recent advances in the area, including topological persistence and hierarchical Morse complexes. Algorithms and data structures are presented when appropriate.

    • Presents classical topological subject of Morse theory in a computer science context
    • Material is widely used within computation geometry and computer graphics
    Read more

    Reviews & endorsements

    "In my knowledge, it is the first book covering these topics."
    Numerical Algorithms

    "This authoritative, well-written, and highly focused book will explain to the reader the considerable power of topology. It is an eye-opener that I highly recommend."
    George Hacken,

    See more reviews

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity


    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?


    Product details

    • Date Published: January 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.

  • Author

    Afra J. Zomorodian, Dartmouth College, New Hampshire
    Afra J. Zomorodian is an assistant professor in the Department of Computer Science at Dartmouth College. He is a former Post-Doctoral Fellow in Bio-X and the Department of Computer Science at Stanford University, California and has been a researcher at the Max-Planck-Institut für Informatik, Saarbrücken. Using the material contained in this book, he has organized classes on computational topology at Stanford University, the MPI, and Dartmouth College.

Sign In

Please sign in to access your account


Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner Please see the permission section of the catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.


Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

Please fill in the required fields in your feedback submission.