Upper Bounds on Geometric Permutations for Convex Sets.
R. Wenger (1990)
Discrete & computational geometry
Similarity:
Displaying similar documents to “Geometric Permutations and Common Transversals.”
Upper Bounds on Geometric Permutations for Convex Sets.
The Maximum Number of Ways To Stab n Convex Nonintersecting Sets in the Plane Is 2n - 2*.
H. Edelsbrunner, M. Sharir (1990)
Discrete & computational geometry
Similarity:
A Generalization of Hadwiger's Transversal Theorem to Intersecting Sets.
R. Wenger (1990)
Discrete & computational geometry
Similarity:
A Gallai-Type Transversal Problem in the Plane.
J. Eckhoff (1993)
Discrete & computational geometry
Similarity:
On the Exact Constant in the Quantitative Steinitz Theorem in the Plane.
I. Bárány, A. Heppes (1994)
Discrete & computational geometry
Similarity:
Polyhedral Line Transversals in Space.
D. Avis, Rephael Wenger (1988)
Discrete & computational geometry
Similarity:
Finding Minimum Area k-gons.
D. Eppstein, M. Overmars, G Rote, G. Woeginger (1992)
Discrete & computational geometry
Similarity:
Objects that Cannot Be Taken Apart with Two Hands.
J. Snoeyink, J. Stolfi (1994)
Discrete & computational geometry
Similarity:
A Combinatorial Property of Points and Ellipsoids.
D.G. Larman, I. Bàràny (1990)
Discrete & computational geometry
Similarity:
On Translating One Polyomino To Tile the Plane.
D. Beauquier, M. Nivat (1991)
Discrete & computational geometry
Similarity:
Bounding the Piercing Number.
G. Kalai, N. Alon (1995)
Discrete & computational geometry
Similarity: