Computational topology : an introduction

Author(s)

• Edelsbrunner, Herbert
• Harer, John L.

Bibliographic Information

Computational topology : an introduction

Herbert Edelsbrunner, John L. Harer

American Mathematical Society, c2010

Note

Includes bibliographical references and index

Description and Table of Contents

Description

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.

Table of Contents

Preface Part I. Computational geometric topology Graphs Surfaces Complexes Part II. Computational algebraic topology Homology Duality Morse functions Part III. Computational persistent topology Persistence Stability Applications References Index

by "Nielsen BookData"

• NCID: BB00854313
• ISBN:
  • 9780821849255
• LCCN: 2009028121
• Country Code: us
• Title Language Code: eng
• Text Language Code: eng
• Place of Publication: Providence, R.I.
• Pages/Volumes: xii, 241 p.
• Size: 26 cm
• Classification:
  • LCC : QA611
  • DC22 : 514
• Subject Headings:
  • LCSH : Topology -- Data processing
  • LCSH : Geometry -- Data processing
  • LCSH : Computational complexity
  • LCSH : Algorithms