An Upper Bound for Conforming Delaunay Triangulations.
H. Edelsbrunner, Tiow Seng Tan (1993)
Discrete & computational geometry
Similarity:
Displaying similar documents to “An Upper Bound on the Number of Planar K-Sets.”
An Upper Bound for Conforming Delaunay Triangulations.
Lower-Bound Theorems for Pseudomanifolds.
Tiong-Seng Tay (1995)
Discrete & computational geometry
Similarity:
How Hard Is Half-Space Range Searching?
J. Pach, B. Chazelle, H. Brönnimann (1993)
Discrete & computational geometry
Similarity:
New Bounds for Lower Envelopes in Three Dimensions, with Applications to Visibility in Terrains.
M. Sharir, D. Halperin (1994)
Discrete & computational geometry
Similarity:
Lower Bounds on Moving a Ladder in Two and Three Dimensions.
Y. Ke, Joseph O'Rourke (1988)
Discrete & computational geometry
Similarity:
An Equipartition of Planar Sets.
L.J. Schulman (1993)
Discrete & computational geometry
Similarity:
The Upper Envelope of Piecewise Linear Functions: Tight Bounds on the Number of Faces.
H. Edelsbrunner (1989)
Discrete & computational geometry
Similarity:
Tight Upper Bounds for the Discrepancy of Half-Spaces.
J. Matousek (1995)
Discrete & computational geometry
Similarity:
Bounds on the Size of Tetrahedralizations.
B. Chazelle, N. Shouraboura (1995)
Discrete & computational geometry
Similarity:
The Maximum Number of Second Smallest Distances in Finite Planar Sets.
P. Brass (1992)
Discrete & computational geometry
Similarity:
An Upper Bound for the Minimum Diameter of Integral Point Sets.
H. Harborth, A. Kemnitz, M. ` Möller (1993)
Discrete & computational geometry
Similarity: