More on k-Sets of Finite Sets in the Plane.
E. Welzl (1986)
Discrete & computational geometry
Similarity:
Displaying similar documents to “A Gallai-Type Transversal Problem in the Plane.”
More on k-Sets of Finite Sets in the Plane.
On the Exact Constant in the Quantitative Steinitz Theorem in the Plane.
I. Bárány, A. Heppes (1994)
Discrete & computational geometry
Similarity:
On Translating One Polyomino To Tile the Plane.
D. Beauquier, M. Nivat (1991)
Discrete & computational geometry
Similarity:
Polygonizations of Point Sets in the Plane.
L. Deneen, Gary Shute (1988)
Discrete & computational geometry
Similarity:
The Number of Different Distances Determined by a Set of Points in the Euclidean Plane.
F.R.K. Chung, E. Szemeredi, W.T. Trotter (1992)
Discrete & computational geometry
Similarity:
Separating Convex Sets in the Plane.
J. Urrutia, J. Czyzowicz, E. Rivera-Campo, J. Zaks (1992)
Discrete & computational geometry
Similarity:
Two Combinatorial Problems in the Plane.
P. Erdös, G. Purdy (1995)
Discrete & computational geometry
Similarity:
A Generalization of Hadwiger's Transversal Theorem to Intersecting Sets.
R. Wenger (1990)
Discrete & computational geometry
Similarity:
Reconstructing Plane Sets from Projections.
G. Bianchi, M. Longinetti (1990)
Discrete & computational geometry
Similarity:
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:
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: