Topological persistence and simplification

Discrete and Computational Geometry

Volumn 28, Issue 4, 2002, Pages 511-533

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

^a Department of Computer Science Duke University ^*  (United States)

^b Raindrop Geomagic   (United States)

^c OKLAHOMA STATE UNIVERSITY   (United States)

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

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036883297     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00454-002-2885-2     Document Type: Article

References (11)

1. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. The MIT Press, Cambridge, Massachusetts, 1994.
2. C. J. A. Delfinado and 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 and E. P. Mücke. Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms. ACM Trans. Graphics, 9:66-104, 1990.
4. H. Edelsbrunner and E. P. Mücke. Three-dimensional alpha shapes. ACM Trans. Graphics, 13:43-72, 1994.
5. J. El-Sana and A. Varshney. Topology simplification for polygonal virtual environments. IEEE Trans. Visual. Comput. Graphics, 4:133-144, 1998.
6. E. Martz. Protein explorer 1.80b. http://www.umass.edu/microbio/chime/explorer.
7. J. McCleary. User's Guide to Spectral Sequences. Publish or Perish, Wilmington, Delaware, 1985.
8. J. Milnor. Morse Theory. Princeton University Press, Princeton, New Jersey, 1963.
9. J. R. Munkres. Elements of Algebraic Topology. Addison-Wesley, Redwood City, California, 1984.
10. V. Robins. Computing topology at multiple resolutions: foundations and applications to fractals and dynamics. Ph.D. thesis, Department of Applied Mathematics, University of Colorado, June 2000.
11. J. A. Sethian. Level Set Methods. Cambridge University Press, Cambridge, 1996.