Item Successfully Added to Cart
An error was encountered while trying to add the item to the cart. Please try again.
OK
Please make all selections above before adding to cart
OK
Share this page via the icons above, or by copying the link below:
Copy To Clipboard
Successfully Copied!
Computational Topology: An Introduction
 
Herbert Edelsbrunner Duke University, Durham, NC and Geomagic, Research Triangle Park, NC
John L. Harer Duke University, Durham, NC
Computational Topology
Softcover ISBN:  978-1-4704-6769-2
Product Code:  MBK/69.S
List Price: $75.00
MAA Member Price: $67.50
AMS Member Price: $60.00
eBook ISBN:  978-1-4704-1208-1
Product Code:  MBK/69.E
List Price: $69.00
MAA Member Price: $62.10
AMS Member Price: $55.20
Softcover ISBN:  978-1-4704-6769-2
eBook: ISBN:  978-1-4704-1208-1
Product Code:  MBK/69.S.B
List Price: $144.00 $109.50
MAA Member Price: $129.60 $98.55
AMS Member Price: $115.20 $87.60
Computational Topology
Click above image for expanded view
Computational Topology: An Introduction
Herbert Edelsbrunner Duke University, Durham, NC and Geomagic, Research Triangle Park, NC
John L. Harer Duke University, Durham, NC
Softcover ISBN:  978-1-4704-6769-2
Product Code:  MBK/69.S
List Price: $75.00
MAA Member Price: $67.50
AMS Member Price: $60.00
eBook ISBN:  978-1-4704-1208-1
Product Code:  MBK/69.E
List Price: $69.00
MAA Member Price: $62.10
AMS Member Price: $55.20
Softcover ISBN:  978-1-4704-6769-2
eBook ISBN:  978-1-4704-1208-1
Product Code:  MBK/69.S.B
List Price: $144.00 $109.50
MAA Member Price: $129.60 $98.55
AMS Member Price: $115.20 $87.60
  • Book Details
     
     
    2010; 241 pp
    MSC: Primary 00; 52; 55; 57; 68;

    Combining concepts from topology and algorithms, this book delivers what its title promises: an introduction to the field of computational topology. Starting with motivating problems in both mathematics and computer science and building up from classic topics in geometric and algebraic topology, the third part of the text advances to persistent homology. This point of view is critically important in turning a mostly theoretical field of mathematics into one that is relevant to a multitude of disciplines in the sciences and engineering.

    The main approach is the discovery of topology through algorithms. The book is ideal for teaching a graduate or advanced undergraduate course in computational topology, as it develops all the background of both the mathematical and algorithmic aspects of the subject from first principles. Thus the text could serve equally well in a course taught in a mathematics department or computer science department.

    Readership

    Graduate students and research mathematicians interested in topology, algorithms, and applications to science and engineering.

  • Table of Contents
     
     
    • A. Computational geometric topology
    • I. Graphs
    • II. Surfaces
    • III. Complexes
    • B. Computational algebraic topology
    • IV. Homology
    • V. Duality
    • VI. Morse functions
    • C. Computational persistent topology
    • VII. Persistence
    • VIII. Stability
    • IX. Applications
  • Reviews
     
     
    • This book is a very welcome, untraditional, thorough and well-organized introduction to a young and quickly developing discipline on the crossroads between mathematics, computer science, and engineering.

      DMV Newsletter
  • Requests
     
     
    Review Copy – for publishers of book reviews
    Desk Copy – for instructors who have adopted an AMS textbook for a course
    Examination Copy – for faculty considering an AMS textbook for a course
    Permission – for use of book, eBook, or Journal content
    Accessibility – to request an alternate format of an AMS title
2010; 241 pp
MSC: Primary 00; 52; 55; 57; 68;

Combining concepts from topology and algorithms, this book delivers what its title promises: an introduction to the field of computational topology. Starting with motivating problems in both mathematics and computer science and building up from classic topics in geometric and algebraic topology, the third part of the text advances to persistent homology. This point of view is critically important in turning a mostly theoretical field of mathematics into one that is relevant to a multitude of disciplines in the sciences and engineering.

The main approach is the discovery of topology through algorithms. The book is ideal for teaching a graduate or advanced undergraduate course in computational topology, as it develops all the background of both the mathematical and algorithmic aspects of the subject from first principles. Thus the text could serve equally well in a course taught in a mathematics department or computer science department.

Readership

Graduate students and research mathematicians interested in topology, algorithms, and applications to science and engineering.

  • A. Computational geometric topology
  • I. Graphs
  • II. Surfaces
  • III. Complexes
  • B. Computational algebraic topology
  • IV. Homology
  • V. Duality
  • VI. Morse functions
  • C. Computational persistent topology
  • VII. Persistence
  • VIII. Stability
  • IX. Applications
  • This book is a very welcome, untraditional, thorough and well-organized introduction to a young and quickly developing discipline on the crossroads between mathematics, computer science, and engineering.

    DMV Newsletter
Review Copy – for publishers of book reviews
Desk Copy – for instructors who have adopted an AMS textbook for a course
Examination Copy – for faculty considering an AMS textbook for a course
Permission – for use of book, eBook, or Journal content
Accessibility – to request an alternate format of an AMS title
You may be interested in...
Please select which format for which you are requesting permissions.