• Cite/Export
  Cite/Export

  Copy a citation

  APA (6th ed.)

  

  Chicago (Author-Date, 15th ed.)

  

  Harvard (18th ed.)

  

  MLA (7th ed.)

  

  Turabian (6th ed.)

  

  Export a citation

  Export to RefWorks   Export to EndNote / Reference Manager   Export to EasyBib
  Export to EndNote / Reference Manager(non-Latin)   Cancel

  Note: Citations are based on reference standards. However, formatting rules can vary widely between applications and fields of interest or study. The specific requirements or preferences of your reviewing publisher, classroom teacher, institution or organization should be applied.
• Print
• E-mail
  E-mail

  All fields are required.

  The E-mail Address(es) field is required. Please enter recipient e-mail address(es).

  The E-mail Address(es) you entered is(are) not in a valid format. Please re-enter recipient e-mail address(es).

  You may send this item to up to five recipients.

  Enter recipient e-mail address(es): Separate up to five addresses with commas (,)

  The name field is required. Please enter your name.

  Enter your name: The subject field is required. Please enter the subject. Subject:

  The E-mail message field is required. Please enter the message.

  E-mail Message: I thought you might be interested in this item at http://www.worldcat.org/oclc/427757156 Title: Computational topology : an introduction Author: Herbert Edelsbrunner; J Harer Publisher: Providence, R.I. : American Mathematical Society, ©2010. ISBN/ISSN: 9780821849255 0821849255 OCLC:427757156

  
  

  Please verify that you are not a robot.

  Cancel
• Share
• Permalink
  Permalink

  Copy this URL to link to this page:

Computational topology : an introduction

Author:	Herbert Edelsbrunner; J Harer
Publisher:	Providence, R.I. : American Mathematical Society, ©2010.
Edition/Format:	Print book : EnglishView all editions and formats
Summary:	"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."--Jacket.  Read more...
Subjects	Topology -- Data processing. Geometry -- Data processing. Computational complexity. View all subjects
More like this	User lists Similar Items