Topological persistence and simplification

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2000, Pages 454-463

  Edelsbrunner, Herbert ^a   Letscher, David ^b   Zomorodian, Afra ^c  

^a Duke University   (United States)

^b OKLAHOMA STATE UNIVERSITY   (United States)

^c University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; THEOREM PROVING;

COMPUTATIONAL TOPOLOGY;

TOPOLOGY;

EID: 0034505541     PISSN: 02725428     EISSN: None     Source Type: Journal    
DOI: 10.1109/SFCS.2000.892133     Document Type: Article

References (8)

1. T. H. Cormen C. E. Leiserson R. L. Rivest Introduction to Algorithms 1994 The MIT Press MA, Cambridge
2. C. J. A. Delfinado H. Edelsbrunner An incremental algorithm for betti numbers of simplicial complexes on the 3-sphere Comput. Aided Geom. Design 12 771 784 1995
3. H. Edelsbrunner E. P. Mücke Three-dimensional alpha shapes ACM Trans. Graphics 13 43 72 1994
4. J. El-Sana A. Varshney Topology simplification for polygonal virtual environments IEEE Trans. Visualization Comput. Graphics 4 133 144 1998
5. J. McCleary User's Guide to Spectral Sequences 1985 Publish or Perish Delaware, Wilmington
6. J. Milnor Morse Theory 1963 Princeton Univ. Press New Jersey
7. J. R. Munkres Elements of Algebraic Topology 1984 Addison-Wesley California, Redwood City
8. J. A. Sethian Level Set Methods 1996 Cambridge Univ. Press England, Cambridge