The Maximum Size of a Convex Polygon in a Restricted Set of Points in the Plane.
N. Alon, M. Katchalski, W.R. Pulleyblank (1989)
Discrete & computational geometry
Similarity:
Displaying similar documents to “The Maximum Number of Ways To Stab n Convex Nonintersecting Sets in the Plane Is 2n - 2*.”
The Maximum Size of a Convex Polygon in a Restricted Set of Points in the Plane.
Separating Convex Sets in the Plane.
J. Urrutia, J. Czyzowicz, E. Rivera-Campo, J. Zaks (1992)
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:
Geometric Permutations and Common Transversals.
M. Katchalski, T. Lewis, A. Liu (1986)
Discrete & computational geometry
Similarity:
A Postscript on Distances in Convex n-Gons.
P. Erdös, P. Fishburn (1994)
Discrete & computational geometry
Similarity:
Finding Minimum Area k-gons.
D. Eppstein, M. Overmars, G Rote, G. Woeginger (1992)
Discrete & computational geometry
Similarity:
The Order of Points on the Second Convex Hull of a Simple Polygon.
A. Garcia, J. Tejel (1995)
Discrete & computational geometry
Similarity:
The Different Ways of Stabbing Disjoint Convex Sets.
M. Katchalski, T. Lewis, A. Liu (1992)
Discrete & computational geometry
Similarity:
Generalized Breadths, Circular Cantor Sets, and the Least Area UCC .
Gy. Elekes (1994)
Discrete & computational geometry
Similarity: