Triangulating Point Sets in Space.
D. Avis, Hossam ElGindy (1987)
Discrete & computational geometry
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “On the Ball Spanned by Balls.”
Triangulating Point Sets in Space.
Higher-Dimensional Voronoi Diagrams in Linear Expected Time.
R.A. Dwyer (1991)
Discrete & computational geometry
Similarity:
A Combinatorial Result About Points and Balls in Euclidean Space.
I. Bárány, J.H. Schmerl, S.J. Sidney, J. Urrutia (1989)
Discrete & computational geometry
Similarity:
Diameter Partitioning.
D. Avis (1986)
Discrete & computational geometry
Similarity:
On Lazy Randomized Incremental Construction.
O. Schwarzkopf, M. de Berg, K. Dobrindt (1995)
Discrete & computational geometry
Similarity:
Halfspace Range Search: An Algorithmic Application of k-Sets.
B. Chazelle, F.P. Preparata (1986)
Discrete & computational geometry
Similarity:
A Fast Las Vegas Algorithm for Triangulating a Simple Polygon.
Robert E. Tarjan, K.L. Clarkson, Christopher J. van Wyk (1989)
Discrete & computational geometry
Similarity:
On the Average Number of k-Sets.
M. Pellegrini, P.W. Shor (1992)
Discrete & computational geometry
Similarity:
An Efficient Algorithm for Guard Placement in Polygons with Holes.
I. Bjorling-Sachs, D.L. Souvaine (1995)
Discrete & computational geometry
Similarity:
A Geometric Inequality and the Complexity of Computing Volume.
G. Elekes (1986)
Discrete & computational geometry
Similarity:
Algorithms for Ham Sandwich Cuts.
J. Matousek, W. Steiger, Chi-Yuan Lo (1994)
Discrete & computational geometry
Similarity: