Constructing Arrangements Optimally in Parallel.
M.T. Goodrich (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 “Construction of e-Nets.”
Constructing Arrangements Optimally in Parallel.
Partitioning Arrangements of Lines, II: Applications.
P.K. Agarwal (1990)
Discrete & computational geometry
Similarity:
Counting Facets and Incidences.
P.K. Agarwal, B. Aronov (1992)
Discrete & computational geometry
Similarity:
Cutting Hyperplane Arrangements.
J. Matousek (1991)
Discrete & computational geometry
Similarity:
On Levels in Arrangements and Voronoi Diagrams.
K. Mulmuley (1991)
Discrete & computational geometry
Similarity:
The Upper Envelope of Piecewise Linear Functions: Algorithms and Applications.
H. Edelsbrunner, Micha Sharir, Leonidas J. Guibas (1989)
Discrete & computational geometry
Similarity:
Mathematical snapshots from the computational geometry landscape.
Matoušek, Jiří (1998)
Documenta Mathematica
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:
Nonrealizability Proofs in Computational Geometry.
B. Sturmfels, J. Bokowski, J. Richter (1990)
Discrete & computational geometry
Similarity:
On Lines Missing Polyhedral Sets in 3-Space.
M. Pellegrini (1994)
Discrete & computational geometry
Similarity:
Computing Simple Circuits from a Set of Line Segments.
D. Rappaport, H. Imai, G.T. Toussaint (1990)
Discrete & computational geometry
Similarity: