On the Construction of Abstract Voronoi Diagrams.
K. Mehlhorn, St. Meiser, C. ó'Dúnlaing (1991)
Discrete & computational geometry
Similarity:
Displaying similar documents to “Higher-Dimensional Voronoi Diagrams in Linear Expected Time.”
On the Construction of Abstract Voronoi Diagrams.
On Lazy Randomized Incremental Construction.
O. Schwarzkopf, M. de Berg, K. Dobrindt (1995)
Discrete & computational geometry
Similarity:
Simplified Voronoi Diagrams.
J. Canny, Bruce Donald (1988)
Discrete & computational geometry
Similarity:
Triangulating Point Sets in Space.
D. Avis, Hossam ElGindy (1987)
Discrete & computational geometry
Similarity:
Halfspace Range Search: An Algorithmic Application of k-Sets.
B. Chazelle, F.P. Preparata (1986)
Discrete & computational geometry
Similarity:
The Upper Envelope of Piecewise Linear Functions: Algorithms and Applications.
H. Edelsbrunner, Micha Sharir, Leonidas J. Guibas (1989)
Discrete & computational geometry
Similarity:
Algorithms for Ham Sandwich Cuts.
J. Matousek, W. Steiger, Chi-Yuan Lo (1994)
Discrete & computational geometry
Similarity:
Computability and Complexity of Ray Tracing.
J.H. Reif, J.D. Tygar, A. Yoshida (1994)
Discrete & computational geometry
Similarity:
On the Average Number of k-Sets.
M. Pellegrini, P.W. Shor (1992)
Discrete & computational geometry
Similarity:
A New Duality Result Concerning Voronoi Diagrams.
F. Aurenhammer (1990)
Discrete & computational geometry
Similarity:
On the Complexity of Polyhedral Separability.
N. Megiddo (1988)
Discrete & computational geometry
Similarity: