Two Combinatorial Problems in the Plane.
P. Erdös, G. Purdy (1995)
Discrete & computational geometry
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “The concept of cutting vectors for vector systems in the Euclidean plane.”
Two Combinatorial Problems in the Plane.
Partitioning Arrangements of Lines, II: Applications.
P.K. Agarwal (1990)
Discrete & computational geometry
Similarity:
Constructing Arrangements Optimally in Parallel.
M.T. Goodrich (1993)
Discrete & computational geometry
Similarity:
Arrangements of Lines with a Minimum Number of Triangles Are Simple.
J.P. Roudneff (1988)
Discrete & computational geometry
Similarity:
The Complexity and Construction of Many Faces in Arrangements of Lines and of Segments.
H. Edelsbrunner, L.J. Guibas, M. Sharir (1990)
Discrete & computational geometry
Similarity:
Cutting Hyperplane Arrangements.
J. Matousek (1991)
Discrete & computational geometry
Similarity:
Construction of e-Nets.
J. Matousek (1990)
Discrete & computational geometry
Similarity:
Arrangements of Segments that Share Endpoints: Single Face Results.
K. Kedem, D. Halperin, E.M. Arkin, J. S. B. Mitchell, N. Naor (1995)
Discrete & computational geometry
Similarity:
Arrangements of Oriented Hyperplanes.
J. Linhart (1993)
Discrete & computational geometry
Similarity:
A Matroid on Hypergraphs, with Applications in Scene Analysis and Geometry.
W. Whiteley (1989)
Discrete & computational geometry
Similarity:
Voroni Diagrams and Arrangements.
H. Edelsbrunner, Raimund Seidel (1986)
Discrete & computational geometry
Similarity: