Cheng, Ho, et al. “Dynamic Skin Triangulation.”10.1007/s00454-001-0007-1__Discrete &; Computational Geometry, vol. 25, no. 4, Springer, 2001, pp. 525–68, doi:10.1007/s00454-001-0007-1.

Wagner, Uli, and Emo Welzl. “A Continuous Analogue of the Upper Bound Theorem.”10.1007/s00454-001-0028-9__Discrete &; Computational Geometry, vol. 26, no. 2, Springer, 2001, pp. 205–19, doi:10.1007/s00454-001-0028-9.

Edelsbrunner, Herbert, and Daniel Grayson. “Edgewise Subdivision of a Simplex.”10.1007/s004540010063__Discrete &; Computational Geometry, vol. 24, no. 4, Springer, 2000, pp. 707–19, doi:10.1007/s004540010063.

Edelsbrunner, Herbert. “Deformable Smooth Surface Design.”10.1007/PL00009412__Discrete &; Computational Geometry, vol. 21, no. 1, Springer, 1999, pp. 87–115, doi:10.1007/PL00009412.

Edelsbrunner, Herbert, et al. “Cutting Dense Point Sets in Half.”10.1007/PL00009291__Discrete &; Computational Geometry, vol. 17, no. 3, Springer, 1997, pp. 243–55, doi:10.1007/PL00009291.

Edelsbrunner, Herbert, and Edgar Ramos. “Inclusion-Exclusion Complexes for Pseudodisk Collections.”10.1007/PL00009295__Discrete &; Computational Geometry, vol. 17, no. 3, Springer, 1997, pp. 287–306, doi:10.1007/PL00009295.

Chazelle, Bernard, et al. “Improved Bounds on Weak ;5-Nets for Convex Sets.”10.1007/BF02574025__Discrete &; Computational Geometry, vol. 13, no. 1, Springer, 1995, pp. 1–15, doi:10.1007/BF02574025.

Edelsbrunner, Herbert. “The Union of Balls and Its Dual Shape.”10.1007/BF02574053__Discrete &; Computational Geometry, vol. 13, no. 1, Springer, 1995, pp. 415–40, doi:10.1007/BF02574053.

Dey, Tamal, and Herbert Edelsbrunner. “Counting Triangle Crossings and Halving Planes.”10.1007/BF02574381__Discrete &; Computational Geometry, vol. 12, no. 1, Springer, 1994, pp. 281–89, doi:10.1007/BF02574381.

Edelsbrunner, Herbert, and Tiow Tan. “An Upper Bound for Conforming Delaunay Triangulations.”10.1007/BF02573974__Discrete &; Computational Geometry, vol. 10, no. 1, Springer, 1993, pp. 197–213, doi:10.1007/BF02573974.

Bern, Marshall, et al. “Edge Insertion for Optimal Triangulations.”10.1007/BF02573962__Discrete &; Computational Geometry, vol. 10, no. 1, Springer, 1993, pp. 47–65, doi:10.1007/BF02573962.

Chazelle, Bernard, et al. “Diameter, Width, Closest Line Pair, and Parametric Searching.”10.1007/BF02573973__Discrete &; Computational Geometry, vol. 10, no. 1, Springer, 1993, pp. 183–96, doi:10.1007/BF02573973.

Agarwal, Pankaj, et al. “Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.”10.1007/BF02574698__Discrete &; Computational Geometry, vol. 6, no. 1, Springer, 1991, pp. 407–22, doi:10.1007/BF02574698.

Aronov, Boris, et al. “Points and Triangles in the Plane and Halving Planes in Space.”10.1007/BF02574700__Discrete &; Computational Geometry, vol. 6, no. 1, Springer, 1991, pp. 435–42, doi:10.1007/BF02574700.

Edelsbrunner, Herbert, et al. “The Complexity of Many Cells in Arrangements of Planes and Related Problems.”10.1007/BF02187785__Discrete &; Computational Geometry, vol. 5, no. 1, Springer, 1990, pp. 197–216, doi:10.1007/BF02187785.

Edelsbrunner, Herbert, et al. “The Complexity and Construction of Many Faces in Arrangements of Lines and of Segments.”10.1007/BF02187784__Discrete &; Computational Geometry, vol. 5, no. 1, Springer, 1990, pp. 161–96, doi:10.1007/BF02187784.

Edelsbrunner, Herbert, and Micha Sharir. “The Maximum Number of Ways to Stabn Convex Nonintersecting Sets in the Plane Is 2n2.”10.1007/BF02187778__Discrete &; Computational Geometry, vol. 5, no. 1, Springer, 1990, pp. 35–42, doi:10.1007/BF02187778.

Clarkson, Kenneth, et al. “Combinatorial Complexity Bounds for Arrangements of Curves and Spheres.”10.1007/BF02187783__Discrete &; Computational Geometry, vol. 5, no. 1, Springer, 1990, pp. 99–160, doi:10.1007/BF02187783.

Edelsbrunner, Herbert, et al. “Implicitly Representing Arrangements of Lines or Segments.”10.1007/BF02187742__Discrete &; Computational Geometry, vol. 4, no. 1, Springer, 1989, pp. 433–66, doi:10.1007/BF02187742.

Edelsbrunner, Herbert, et al. “On Arrangements of Jordan Arcs with Three Intersections per Pair.”10.1007/BF02187745__Discrete &; Computational Geometry, vol. 4, no. 1, Springer, 1989, pp. 523–39, doi:10.1007/BF02187745.