Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

FOCS
2000
IEEE

favoriteEmaildiscussreport

91views Theoretical Computer Science» more FOCS 2000»

Topological Persistence and Simplification

13 years 8 months ago

Topological Persistence and Simplification

Download www.cs.duke.edu

We formalize a notion of topological simplification within the framework of a filtration, which is the history of a growing complex. We classify a topological change that happens during growth as either a feature or noise depending on its life-time or persistence within the filtration. We give fast algorithms for computing persistence and experimental evidence for their speed and utility. Keywords. Computational geometry, computational topology, homology groups, filtrations, alpha shapes.

Herbert Edelsbrunner, David Letscher, Afra Zomorod

Real-time Traffic

Fast Algorithms | FOCS 2000 | Theoretical Computer Science | Topological Change | Topological Simplification |

claim paper

Related Content

» Optimal topological simplification of discrete functions on surfaces

» Computing geometryaware handle and tunnel loops in 3D models

» Generalized ViewDependent Simplification

» Stability of Critical Points with Interval Persistence

» Hierarchyless Simplification Stripification and Compression of Triangulated Two Manifolds

» Topological simplification of isosurfaces in volumetric data using octrees

» Dual Contouring with TopologyPreserving Simplification Using Enhanced Cell Representation

» Extracting Higher Order Critical Points and Topological Simplification of 3D Vector Fields

» Optimal and topologically safe simplification of building footprints

Post Info
More Details (n/a)

Added	24 Aug 2010
Updated	24 Aug 2010
Type	Conference
Year	2000
Where	FOCS
Authors	Herbert Edelsbrunner, David Letscher, Afra Zomorodian

Comments (0)