Arrangements of Oriented Hyperplanes.
J. Linhart (1993)
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 “Combinatorial Complexity Bounds for Arrangements of Curves and Spheres.”
Arrangements of Oriented Hyperplanes.
Cutting Hyperplane Arrangements.
J. Matousek (1991)
Discrete & computational geometry
Similarity:
Voroni Diagrams and Arrangements.
H. Edelsbrunner, Raimund Seidel (1986)
Discrete & computational geometry
Similarity:
Counting Facets and Incidences.
P.K. Agarwal, B. Aronov (1992)
Discrete & computational geometry
Similarity:
On Levels in Arrangements and Voronoi Diagrams.
K. Mulmuley (1991)
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:
Vertical Decomposition of Arrangements of Hyperplanes in Four Dimensions.
L.J. Guibas, M. Sharir, J. Matousek, D. Halperin (1995)
Discrete & computational geometry
Similarity:
Hyperplane Arrangements with a Lattice of Regions.
A. Björner, P.H. Edelman, G.M. Ziegler (1990)
Discrete & computational geometry
Similarity:
Arrangements of Lines with a Minimum Number of Triangles Are Simple.
J.P. Roudneff (1988)
Discrete & computational geometry
Similarity:
Dynamic Point Location in Arrangements of Hyperplanes.
J. Matousek (1992)
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: