On the Modality of Convex Polygons.
K. Abrahamson (1990)
Discrete & computational geometry
Similarity:
Displaying similar documents to “On the Expected Number of k-Sets.”
On the Modality of Convex Polygons.
Probability that n Random Points Are in Convex Position.
P. Valtr (1995)
Discrete & computational geometry
Similarity:
Finding Minimum Area k-gons.
D. Eppstein, M. Overmars, G Rote, G. Woeginger (1992)
Discrete & computational geometry
Similarity:
Computing the Volume is Difficult.
I. Bárány, Zoltán Füredi (1987)
Discrete & computational geometry
Similarity:
The Complexity of Cutting Complexes.
B. Chazelle, Herbert Edelsbrunner, Guibas Leonidas J. (1989)
Discrete & computational geometry
Similarity:
Objects that Cannot Be Taken Apart with Two Hands.
J. Snoeyink, J. Stolfi (1994)
Discrete & computational geometry
Similarity:
An Optimal Convex Hull Algorithm in Any Fixed Dimension.
B. Chazelle (1993)
Discrete & computational geometry
Similarity:
Nonoverlap of the Star Unfolding.
H. Edelsbrunner (1992)
Discrete & computational geometry
Similarity:
Bounding the Piercing Number.
G. Kalai, N. Alon (1995)
Discrete & computational geometry
Similarity:
On the Average Number of k-Sets.
M. Pellegrini, P.W. Shor (1992)
Discrete & computational geometry
Similarity:
A Postscript on Distances in Convex n-Gons.
P. Erdös, P. Fishburn (1994)
Discrete & computational geometry
Similarity:
On Convex Body Chasing.
J. Friedman, N. Linial (1993)
Discrete & computational geometry
Similarity: