A Gallai-Type Transversal Problem in the Plane.
J. Eckhoff (1993)
Discrete & computational geometry
Similarity:
Displaying similar documents to “A Generalization of Hadwiger's Transversal Theorem to Intersecting Sets.”
A Gallai-Type Transversal Problem in the Plane.
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:
On the Exact Constant in the Quantitative Steinitz Theorem in the Plane.
I. Bárány, A. Heppes (1994)
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:
Separating Convex Sets in the Plane.
J. Urrutia, J. Czyzowicz, E. Rivera-Campo, J. Zaks (1992)
Discrete & computational geometry
Similarity:
Polygonizations of Point Sets in the Plane.
L. Deneen, Gary Shute (1988)
Discrete & computational geometry
Similarity:
Visibility and Intersection Problems in Plane Geometry.
B. Chazelle, Leonidas J. Guibas (1989)
Discrete & computational geometry
Similarity:
Repeated Angles in E4 .
G. Purdy (1988)
Discrete & computational geometry
Similarity:
Computing Simple Circuits from a Set of Line Segments.
D. Rappaport, H. Imai, G.T. Toussaint (1990)
Discrete & computational geometry
Similarity:
Bounding the Piercing Number.
G. Kalai, N. Alon (1995)
Discrete & computational geometry
Similarity: