Algorithms and theory of computation handbook: special topics and techniques

[1]  H. Poincaré,et al.  On Analysis Situs , 2010 .

[2]  Stephen Smale,et al.  Finding the Homology of Submanifolds with High Confidence from Random Samples , 2008, Discret. Comput. Geom..

[3]  Bernd Hamann,et al.  Efficient Computation of Morse-Smale Complexes for Three-dimensional Scalar Functions , 2007, IEEE Transactions on Visualization and Computer Graphics.

[4]  Leonidas J. Guibas,et al.  BIOINFORMATICS ORIGINAL PAPER doi:10.1093/bioinformatics/btm250 Structural bioinformatics Persistent voids: a new structural metric for membrane fusion , 2022 .

[5]  Hong Yi,et al.  A survey of the marching cubes algorithm , 2006, Comput. Graph..

[6]  Afra Zomorodian,et al.  The conformal alpha shape filtration , 2006, The Visual Computer.

[7]  Afra Zomorodian,et al.  Computing Persistent Homology , 2004, SCG '04.

[8]  Valerio Pascucci,et al.  Loops in Reeb Graphs of 2-Manifolds , 2003, SCG '03.

[9]  Valerio Pascucci,et al.  Morse-smale complexes for piecewise linear 3-manifolds , 2003, SCG '03.

[10]  Herbert Edelsbrunner,et al.  Hierarchical Morse—Smale Complexes for Piecewise Linear 2-Manifolds , 2003, Discret. Comput. Geom..

[11]  Francis Lazarus,et al.  Optimal System of Loops on an Orientable Surface , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[12]  Jack Snoeyink,et al.  Testing Homotopy for Paths in the Plane , 2002, SCG '02.

[13]  Jeff Erickson,et al.  Optimally Cutting a Surface into a Disk , 2002, SCG '02.

[14]  Stephen G. Kobourov,et al.  Computing homotopic shortest paths efficiently , 2002, Comput. Geom..

[15]  Frank Uhlig.  Transform Linear Algebra , 2001 .

[16]  Herbert Edelsbrunner,et al.  Topological Persistence and Simplification , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[17]  Jack Snoeyink,et al.  Computing contour trees in all dimensions , 2000, SODA '00.

[18]  Tamal K. Dey,et al.  Transforming Curves on Surfaces , 1999, J. Comput. Syst. Sci..

[19]  R. Forman.  Morse Theory for Cell Complexes , 1998 .

[20]  Sunil Arya,et al.  An optimal algorithm for approximate nearest neighbor searching fixed dimensions , 1998, JACM.

[21]  Sunil Arya,et al.  ANN: library for approximate nearest neighbor searching , 1998 .

[22]  Herbert Edelsbrunner,et al.  An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere , 1995, Comput. Aided Geom. Des..

[23]  John Hershberger,et al.  Computing Minimum Length Paths of a Given Homotopy Class (Extended Abstract) , 1991, WADS.

[24]  Herbert Edelsbrunner,et al.  Three-dimensional alpha shapes , 1992, VVS.

[25]  William E. Lorensen,et al.  Marching cubes: A high resolution 3D surface construction algorithm , 1987, SIGGRAPH.

[26]  Leonidas J. Guibas,et al.  Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams , 1983, STOC.

[27]  Loring W. Tu,et al.  Differential forms in algebraic topology , 1982, Graduate texts in mathematics.

[28]  Michael Henle,et al.  A combinatorial introduction to topology , 1978 .

[29]  H. O. Foulkes.  Abstract Algebra , 1967, Nature.

[30]  Roger L. Boyell,et al.  Hybrid techniques for real-time radar simulation , 1963, AFIPS '63 (Fall).