The Different Ways of Stabbing Disjoint Convex Sets.
M. Katchalski, T. Lewis, A. Liu (1992)
Discrete & computational geometry
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Complexes Whose Boundaries Cannot Be Pushed Around.”
The Different Ways of Stabbing Disjoint Convex Sets.
A Postscript on Distances in Convex n-Gons.
P. Erdös, P. Fishburn (1994)
Discrete & computational geometry
Similarity:
Generalized Breadths, Circular Cantor Sets, and the Least Area UCC .
Gy. Elekes (1994)
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:
On Convex Body Chasing.
J. Friedman, N. Linial (1993)
Discrete & computational geometry
Similarity:
Convex Disks Can Cover Their Shadow.
G. Kós, J. Töröcsik (1990)
Discrete & computational geometry
Similarity:
The Orthogonal Convex Skull Problem.
D. Wood, Chee K. Yap (1988)
Discrete & computational geometry
Similarity:
Convex Independent Sets and 7-Holes in Restricted Planar Point Sets.
P. Valtr (1992)
Discrete & computational geometry
Similarity:
On the Modality of Convex Polygons.
K. Abrahamson (1990)
Discrete & computational geometry
Similarity:
Piecewise Linear Paths Among Convex Obstacles.
J. Matousek, O. Schwarzkopf, M. de Berg (1995)
Discrete & computational geometry
Similarity:
The Upper Envelope of Piecewise Linear Functions and the Boundary of a Region Enclosed by Convex Plates: Combinatorial Analysis.
Micha Sharir, Janos Pach (1989)
Discrete & computational geometry
Similarity: