Inferring local homology from sampled stratified spaces
P. Bendich, D. Cohen Steiner, H. Edelsbrunner, J. Harer, D. Morozov, in:, IEEE, 2007, pp. 536–546.

Inclusion-exclusion formulas from independent complexes
D. Attali, H. Edelsbrunner, Discrete &; Computational Geometry 37 (2007) 59–77.

Weak witnesses for Delaunay triangulations of submanifolds
D. Attali, H. Edelsbrunner, Y. Mileyko, in:, ACM, 2007, pp. 143–150.

Inequalities for the curvature of curves and surfaces
D. Cohen Steiner, H. Edelsbrunner, Foundations of Computational Mathematics 7 (2007) 391–404.

Stability of persistence diagrams
D. Cohen Steiner, H. Edelsbrunner, J. Harer, Discrete &; Computational Geometry 37 (2007) 103–120.

Evaluating the quality of NMR structures by local density of protons
Y. Ban, J. Rudolph, P. Zhou, H. Edelsbrunner, Proteins: Structure, Function and Bioinformatics 62 (2006) 852–864.

Interface surfaces for protein-protein complexes
Y. Ban, H. Edelsbrunner, J. Rudolph, Journal of the ACM 53 (2006) 361–378.

Extreme elevation on a 2-manifold
P. Agarwal, H. Edelsbrunner, J. Harer, Y. Wang, Discrete &; Computational Geometry 36 (2006) 553–572.

Method, apparatus and computer program products for automatically generating NURBS models of triangulated surfaces using homeomorphism
H. Edelsbrunner, P. Fu, D. Nekhayev, M. Facello, S. Williams, (2006).

Manufacturing methods and systems for rapid production of hearing-aid shells
P. Fu, D. Nekhayev, H. Edelsbrunner, (2006).

Method, apparatus and computer products that reconstruct surfaces from data points
Y. Fletcher, T. Gloth, H. Edelsbrunner, P. Fu, (2006).

Vines and vineyards by updating persistence in linear time
D. Cohen Steiner, H. Edelsbrunner, D. Morozov, in:, ACM, 2006, pp. 119–126.

Persistence-sensitive simplification of functions on 2-manifolds
H. Edelsbrunner, D. Morozov, V. Pascucci, in:, ACM, 2006, pp. 127–134.

Surface tiling with differential topology
H. Edelsbrunner, in:, ACM, 2005, pp. 9–11.

Methods, apparatus and computer program products for modeling three-dimensional colored objects
S. Williams, H. Edelsbrunner, P. Fu, (2005).

Extraction and simplification of iso-surfaces in tandem
D. Attali, D. Cohen Steiner, H. Edelsbrunner, in:, ACM, 2005, pp. 139–148.

The geometry of biomolecular solvation
H. Edelsbrunner, P. Koehl, in:, Combinatorial and Computational Geometry, Cambridge University Press, 2005, pp. 243–275.

Experimental validation of the docking orientation of Cd with its Cdk2-CycA protein substrate
J. Sohn, J. Parks, G. Buhrman, P. Brown, K. Kristjánsdóttir, A. Safi, H. Edelsbrunner, W. Yang, J. Rudolph, Biochemistry 44 (2005) 16563–16573.

Coarse and reliable geometric alignment for protein docking
Y. Wang, P. Agarwal, P. Brown, H. Edelsbrunner, J. Rudolph, in:, World Scientific Publishing, 2005, pp. 64–75.

Computing the writhing number of a polygonal knot
P. Agarwal, H. Edelsbrunner, Y. Wang, Discrete &; Computational Geometry 32 (2004) 37–53.

Jacobi sets of multiple Morse functions
H. Edelsbrunner, J. Harer, in:, Foundations of Computational Mathematics, Springer, 2004, pp. 37–57.

Biological applications of computational topology
H. Edelsbrunner, in:, Handbook of Discrete and Computational Geometry, CRC Press, 2004, pp. 1395–1412.

Local search heuristic for rigid protein docking
V. Choi, P. Agarwal, H. Edelsbrunner, J. Rudolph, in:, Springer, 2004, pp. 218–229.

The area derivative of a space-filling diagram
R. Bryant, H. Edelsbrunner, P. Koehl, M. Levitt, Discrete &; Computational Geometry 32 (2004) 293–308.

A topological hierarchy for functions on triangulated surfaces
P. Bremer, H. Edelsbrunner, B. Hamann, V. Pascucci, IEEE Transactions on Visualization and Computer Graphics 10 (2004) 385–396.

Simplification of three-dimensional density maps
V. Natarajan, H. Edelsbrunner, IEEE Transactions on Visualization and Computer Graphics 10 (2004) 587–597.

Loops in Reeb graphs of 2-manifolds
K. Cole Mclaughlin, H. Edelsbrunner, J. Harer, V. Natarajan, V. Pascucci, Discrete &; Computational Geometry 32 (2004) 231–244.

Local and global comparison of continuous functions
H. Edelsbrunner, J. Harer, V. Natarajan, V. Pascucci, in:, IEEE, 2004, pp. 275–280.

Morse-Smale complexes for piecewise linear 3-manifolds
H. Edelsbrunner, J. Harer, V. Natarajan, V. Pascucci, in:, ACM, 2003, pp. 361–370.

Surface reconstruction by wrapping finite sets in space
H. Edelsbrunner, in:, Discrete &; Computational Geometry, Springer, 2003, pp. 379–404.

Computing linking numbers of a filtration
H. Edelsbrunner, A. Zomorodian, Homology, Homotopy and Applications 5 (2003) 19–37.

Hierarchical Morse-Smale complexes for piecewise linear 2-manifolds
H. Edelsbrunner, J. Harer, A. Zomorodian, Discrete &; Computational Geometry 30 (2003) 87–107.

Area, perimeter and derivatives of a skin curve
H. Cheng, H. Edelsbrunner, Computational Geometry: Theory and Applications 26 (2003) 173–192.

The weighted-volume derivative of a space-filling diagram
H. Edelsbrunner, P. Koehl, PNAS 100 (2003) 2203–2208.

Relaxed scheduling in dynamic skin triangulation
H. Edelsbrunner, A. Üngör, in:, Proceedings of the Japanese Conference on Discrete and Computational Geometry , Springer, 2003, pp. 135–151.

A multi-resolution data structure for two-dimensional Morse-Smale functions
P. Bremer, H. Edelsbrunner, B. Hamann, V. Pascucci, in:, Proceedings of the 14th IEEE Conference on Visualization , IEEE, 2003, pp. 139–146.

Area and perimeter derivatives of a union of disks
H. Cheng, H. Edelsbrunner, in:, Computer Science in Perspective: Essays Dedicated to Thomas Ottmann, Springer, 2003, pp. 88–97.

Methods of generating three-dimensional digital models of objects by wrapping point cloud data points
H. Edelsbrunner, P. Fu, (2002).

Computing the writhing number of a polygonal knot
P. Agarwal, H. Edelsbrunner, Y. Wang, in:, Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2002, pp. 791–799.

Algorithmic issues in modeling motion
P. Agarwal, L. Guibas, H. Edelsbrunner, J. Erickson, M. Isard, S. Har Peled, J. Hershberger, C. Jensen, L. Kavraki, P. Koehl, M. Lin, D. Manocha, D. Metaxas, B. Mirtich, D. Mount, S. Muthukrishnan, D. Pai, E. Sacks, J. Snoeyink, S. Suri, O. Wolefson, ACM Computing Surveys 34 (2002) 550–572.

Fast software for box intersections
A. Zomorodian, H. Edelsbrunner, International Journal of Computational Geometry and Applications 12 (2002) 143–172.

An experimental study of sliver exudation
H. Edelsbrunner, D. Guoy, Engineering with Computers 18 (2002) 229–240.

Topological persistence and simplification
H. Edelsbrunner, D. Letscher, A. Zomorodian, Discrete &; Computational Geometry 28 (2002) 511–533.

Molecular classification for property prediction
J. Liang, H. Edelsbrunner, (2001).

Geometry and Topology for Mesh Generation
H. Edelsbrunner, Geometry and Topology for Mesh Generation, Cambridge University Press, 2001.

Design and analysis of planar shape deformation
S. Cheng, H. Edelsbrunner, P. Fu, K. Lam, Computational Geometry: Theory and Applications 19 (2001) 205–218.

Shape space from deformation
H. Cheng, H. Edelsbrunner, P. Fu, Computational Geometry: Theory and Applications 19 (2001) 191–204.

Dynamic skin triangulation
H. Cheng, T. Dey, H. Edelsbrunner, J. Sullivan, in:, Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2001, pp. 47–56.

Dynamic skin triangulation
H. Cheng, T. Dey, H. Edelsbrunner, J. Sullivan, Discrete &; Computational Geometry 25 (2001) 525–568.

180 wrapped tubes
H. Edelsbrunner, Journal of Universal Computer Science 7 (2001) 379–399.

Adaptive simplicial grids from cross-sections of monotone complexes
H. Edelsbrunner, R. Waupotitsch, International Journal of Computational Geometry and Applications 10 (2000) 267–284.

Sliver exudation
S. Cheng, T. Dey, H. Edelsbrunner, M. Facello, S. Teng, Journal of the ACM 47 (2000) 883–904.

Topological persistance and simplification
H. Edelsbrunner, D. Letscher, A. Zomorodian, in:, Proceedings 41st Annual Symposium on Foundations of Computer Science, IEEE, 2000, pp. 454–463.

Edgewise subdivision of a simplex
H. Edelsbrunner, D. Grayson, Discrete &; Computational Geometry 24 (2000) 707–719.

Smoothing and cleaning up slivers
H. Edelsbrunner, X. Li, G. Miller, A. Stathopoulos, D. Talmor, S. Teng, A. Üngör, N. Walkington, in:, Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, ACM, 2000, pp. 273–277.

Triangulations and meshes in computational geometry
H. Edelsbrunner, Acta Numerica 9 (2000) 133–213.

Spielereien mit Kreisen und Kugeln. Zum Thema Form und Verformung
H. Edelsbrunner, in:, Zur Kunst Des Formalen Denkens, Passagen Verlag, 2000, pp. 153–171.

Mesh association: formulation and algorithms
X. Jiao, H. Edelsbrunner, M. Heath, in:, Proceedings of the 8th International Meshing Roundtable, Elsevier, 1999, pp. 75–82.

Computational topology
T. Dey, H. Edelsbrunner, S. Guha, in:, Advances in Discrete and Computational Geometry, American Mathematical Society, 1999, pp. 109–143.

Deformable smooth surface design
H. Edelsbrunner, Discrete &; Computational Geometry 21 (1999) 87–115.

Topology preserving edge contraction
T. Dey, H. Edelsbrunner, S. Guha, D. Nekhayev, Publications de l’Institut Mathématique 66 (1999) 23–45.

Apparatus and method for geometric morphing
H. Edelsbrunner, P. Fu, (1998).

Auditory Morse analysis of triangulated manifolds
U. Axen, H. Edelsbrunner, in:, Mathematical Visualization, Springer, 1998, pp. 223–236.

Analytical shape computation of macromolecules: I. molecular area and volume through alpha shape
J. Liang, H. Edelsbrunner, P. Fu, P. Sudhakar, S. Subramaniam, Proteins: Structure, Function and Bioinformatics 33 (1998) 1–17.

Geometry for modeling biomolecules
H. Edelsbrunner, in:, Robotics: The Algorithmic Perspective, AK Peters, 1998, pp. 265–277.

Anatomy of protein pockets and cavities: Measurement of binding site geometry and implications for ligand design
J. Liang, H. Edelsbrunner, C. Woodward, Protein Science 7 (1998) 1884–1897.

Analytical shape computation of macromolecules: II. Inaccessible cavities in proteins
J. Liang, H. Edelsbrunner, P. Fu, P. Sudhakar, S. Subramaniam, Proteins: Structure, Function and Bioinformatics 33 (1998) 18–29.

On the definition and the construction of pockets in macromolecules
H. Edelsbrunner, M. Facello, J. Liang, Discrete Applied Mathematics 88 (1998) 83–102.

Shape reconstruction with Delaunay complex
H. Edelsbrunner, in:, Proceedingsof the 3rd Latin American Symposium on Theoretical Informatics, Springer, 1998, pp. 119–132.

Shape space from deformation
H. Cheng, H. Edelsbrunner, P. Fu, in:, Proceedings of the 6th Pacific Conference on Computer Graphics and Applications, IEEE, 1998, pp. 104–113.

Wrapping 3D scanning data
H. Edelsbrunner, M. Facello, P. Fu, J. Qian, D. Nekhayev, in:, SPIE, 1998, pp. 148–158.

Cutting dense point sets in half
H. Edelsbrunner, P. Valtr, E. Welzl, Discrete &; Computational Geometry 17 (1997) 243–255.

A combinatorial approach to cartograms
H. Edelsbrunner, R. Waupotitsch, Computational Geometry: Theory and Applications 7 (1997) 343–360.

Inclusion-exclusion complexes for pseudodisk collections
H. Edelsbrunner, E. Ramos, Discrete &; Computational Geometry 17 (1997) 287–306.

Triangulating topological spaces
H. Edelsbrunner, N. Shah, International Journal of Computational Geometry &; Applications 7 (1997) 365–378.

Geometric modeling in CAVE
H. Edelsbrunner, P. Fu, J. Quian, in:, Proceedings of the ACM Symposium on Virtual Reality Software and Technology, ACM, 1996, pp. 35-41 and-193–194.

Viewing geometric protein structures from inside a CAVE
N. Akkiraju, H. Edelsbrunner, P. Fu, J. Qian, IEEE Computer Graphics and Applications 16 (1996) 58–61.

Triangulating the surface of a molecule
N. Akkiraju, H. Edelsbrunner, Discrete Applied Mathematics 71 (1996) 5–22.

Lines in space: Combinatorics and algorithms
B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, J. Stolfi, Algorithmica 15 (1996) 428–447.

Incremental topological flipping works for regular triangulations
H. Edelsbrunner, N. Shah, Algorithmica 15 (1996) 223–241.

Effects of molecular shape representations on boundary element method for protein electrostatics computations
J. Liang, H. Edelsbrunner, S. Subramaniam, Effects of Molecular Shape Representations on Boundary Element Method for Protein Electrostatics Computations, Cell Press, 1996.

Analytical method for molecular shapes: Area, volume, cavities, interface and pockets
J. Liang, H. Edelsbrunner, S. Pamidghantam, S. Subramaniam, Analytical Method for Molecular Shapes: Area, Volume, Cavities, Interface and Pockets, Cell Press, 1996.

Measuring proteins and voids in proteins
H. Edelsbrunner, M. Facello, P. Fu, J. Liang, in:, Proceedings of the 28th Annual Hawaii International Conference on System Sciences, IEEE, 1995, pp. 256–264.

Alpha shapes: definition and software
N. Akkiraju, H. Edelsbrunner, M. Facello, P. Fu, E. Mücke, C. Varela, in:, Elsevier, 1995, pp. 63–66.

Improved bounds on weak ;5-nets for convex sets
B. Chazelle, H. Edelsbrunner, M. Grigni, L. Guibas, M. Sharir, E. Welzl, Discrete &; Computational Geometry 13 (1995) 1–15.

Algebraic decomposition of non-convex polyhedra
H. Edelsbrunner, in:, Proceedings of IEEE 36th Annual Foundations of Computer Science, IEEE, 1995, pp. 248–257.

The union of balls and its dual shape
H. Edelsbrunner, Discrete &; Computational Geometry 13 (1995) 415–440.

An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere
C. Delfinado, H. Edelsbrunner, Computer Aided Geometric Design 12 (1995) 771–784.

Modeling with simplicial complexes (topology, geometry and algorithms)
H. Edelsbrunner, in:, Proceedings of the 6th Canadian Conference on Computational Geometry, 1994, pp. 36–44.

Ray shooting in polygons using geodesic triangulations
B. Chazelle, H. Edelsbrunner, M. Grigni, L. Guibas, J. Hershberger, M. Sharir, J. Snoeyink, Algorithmica 12 (1994) 54–68.

Algorithms for bichromatic line-segment problems and polyhedral terrains
B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, Algorithmica 11 (1994) 116–132.

Three-dimensional alpha shapes
H. Edelsbrunner, E. Mücke, ACM Transactions on Graphics 13 (1994) 43–72.

Selecting heavily covered points
B. Chazelle, H. Edelsbrunner, L. Guibas, J. Hershberger, R. Seidel, M. Sharir, SIAM Journal on Computing 23 (1994) 1138–1151.

Counting triangle crossings and halving planes
T. Dey, H. Edelsbrunner, Discrete &; Computational Geometry 12 (1994) 281–289.

Computational geometry
H. Edelsbrunner, in:, Current Trends in Theoretical Computer Science, Essays and Tutorials, World Scientific Publishing, 1993, pp. 1–48.

Geometric algorithms
H. Edelsbrunner, in:, Handbook of Convex Geometry, North Holland, 1993, pp. 699–735.

On the zone theorem for hyperplane arrangements
H. Edelsbrunner, R. Seidel, M. Sharir, SIAM Journal on Computing 22 (1993) 418–429.

Computing a face in an arrangement of line segments and related problems
B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, J. Snoeyink, SIAM Journal on Computing 22 (1993) 1286–1302.

An upper bound for conforming Delaunay triangulations
H. Edelsbrunner, T. Tan, Discrete &; Computational Geometry 10 (1993) 197–213.

Edge insertion for optimal triangulations
M. Bern, H. Edelsbrunner, D. Eppstein, S. Mitchell, T. Tan, Discrete &; Computational Geometry 10 (1993) 47–65.