
Preface  Preview Material  Table of Contents  Supplementary Material 
2010; 241 pp; hardcover ISBN10: 0821849255 ISBN13: 9780821849255 List Price: US$59 Member Price: US$47.20 Order Code: MBK/69 See also: The Knot Book: An Elementary Introduction to the Mathematical Theory of Knots  Colin C Adams A First Course in Topology: Continuity and Dimension  John McCleary Elements of Combinatorial and Differential Topology  V V Prasolov  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. Request an examination or desk copy. Readership Graduate students and research mathematicians interested in topology, algorithms, and applications to science and engineering. 


AMS Home 
Comments: webmaster@ams.org © Copyright 2014, American Mathematical Society Privacy Statement 