The expected extremes in a Delaunay triangulation
Marshall Wayne Bern,
David Eppstein,
and Frances F. Yao
Proc. 18th Int. Coll. Automata, Languages, and Programming (ICALP 1991), Lecture Notes in Computer Science 510, Javier Leach Albert,
Burkhard Monien,
and Mario Rodríguez-Artalejo, ed., Springer-Verlag, Jul 1991, pp. 674–685
Int. J. Computational Geometry & Applications 1(1):79–92, Mar 1991
Mathematical Reviews 92e:68189
http://www.ics.uci.edu/~eppstein/pubs/BerEppYao-IJCGA-91.pdf
Cited by:
- Enumerating $k$ longest distances for $n$ points in the plane
- A Delaunay based numerical method for three dimensions: generation, formulation, and partition
- Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations
- Developing a practical projection-based parallel Delaunay algorithm
- Local bisection refinement for $n$-simplicial grids generated by reflection
- Applications of 3D Delaunay triangulation algorithms in geoscientific modelling
- The efficient location of neighbors for locally refined $n$-simplicial grids
- Tools for triangulations and tetrahedralizations and constructing functions defined over them
- Mesh generation
- A note on point location in delaunay triangulations of random points
- Combinatorial aspects of geometric graphs
- A multivariate two-sample test using the Voronoi diagram
- Efficient Parallel Algorithms for Closest Point Problems
- Analysis of a class of $k$-dimensional merge procedures, with an application to 2D Delaunay triangulation in expected linear time after two-directional sorting
- Design and implementation of a practical parallel Delaunay algorithm
- Data generation for geometric algorithms on non-uniform distributions
- Surface triangulation: a survey
- A probabilistic result on multi-dimensional Delaunay triangulations, and its application to the $2D$ case
- Multilevel accelerated optimization for problems in grid generation
- Closing ranks in vehicle formations based on rigidity
