Catalog
- Results include
-
Algorithms in combinatorial geometry
Edelsbrunner, HerbertBerlin ; New York : Springer-Verlag, c1987. -
A short course in computational geometry and topology
Edelsbrunner, HerbertCham : Springer, [2014]With the aim to bring the subject of Computational Geometry and Topology closer to the scientific audience, this book is written in thirteen ready-to-teach sections organized in four parts: TESSELLATIONS, COMPLEXES, HOMOLOGY, PERSISTENCE. To speak to the non-specialist, detailed formalisms are often avoided in favor of lively 2- and 3-dimensional illustrations. The book is warmly recommended to everybody who loves geometry and the fascinating world of shapes.
Online SpringerLink
-
Computational topology : an introduction
Edelsbrunner, HerbertProvidence, R.I. : American Mathematical Society, c2010.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.
Guides
Library website
Exhibits
EarthWorks
More search tools
Tools to help you discover resources at Stanford and beyond.