LEADER 02452cam a22003614a 4500
008 090722s2010 riua b 001 0 eng
a| 9780821849255 (alk. paper)
a| 0821849255 (alk. paper)
a| DLC c| DLC d| YDX d| YDXCP
a| QA611 b| .E353 2010
a| 514 2| 22
a| Edelsbrunner, Herbert. =| ^A592386
a| Computational topology : b| an introduction / c| Herbert Edelsbrunner, John L. Harer.
a| Providence, R.I. : b| American Mathematical Society, c| c2010.
a| xii, 241 p. : b| ill. ; c| 27 cm.
a| Includes bibliographical references and index.
a| Topology x| Data processing. =| ^A1069060
a| Geometry x| Data processing. =| ^A2100523
a| Computational complexity. =| ^A1006707
a| Algorithms. =| ^A991523
a| Harer, J. q| (John), d| 1952- =| ^A554651
a| DATE CATALOGED b| 20100422
a| Z0 b| STF
b| 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. 1| Nielsen x| 9780821849255 x| 20160604
z| Available to Stanford-affiliated users. u| https://stanford.idm.oclc.org/login?url=https://doi.org/10.1090/mbk/069 y| American Mathematical Society x| Provider: American Mathematical Society x| purchased x| eLoaderURL x| aq4 x| aq15828211
a| QA611 .E353 2010 w| LC c| 1 i| 36105215108825 d| 1/26/2018 e| 7/20/2016 l| STACKS m| SCIENCE n| 42 r| Y s| Y t| STKS u| 4/22/2010