scientific article
From MaRDI portal
Publication:3795219
zbMath0649.68040MaRDI QIDQ3795219
Raimund Seidel, János Pach, Micha Sharir, Herbert Edelsbrunner, Richard Pollack, Leonidas J. Guibas
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
combinatorial geometrycomputational geometrycombinatorial complexityzone theoremArrangements of curves in the plane
Analysis of algorithms and problem complexity (68Q25) Computing methodologies and applications (68U99) Other problems of combinatorial convexity (52A37) Discrete mathematics in relation to computer science (68R99)
Related Items (12)
Graphics in flatland revisited ⋮ Triangles in space or building (and analyzing) castles in the air ⋮ Finding constrained and weighted Voronoi diagrams in the plane ⋮ Combinatorial complexity bounds for arrangements of curves and spheres ⋮ On \(k\)-sets in arrangements of curves and surfaces ⋮ Improved combinatorial bounds and efficient techniques for certain motion planning problems with three degrees of freedom ⋮ On the zone of a surface in a hyperplane arrangement ⋮ On the general motion-planning problem with two degrees of freedom ⋮ Implicitly representing arrangements of lines or segments ⋮ Single facility collection depots location problem in the plane ⋮ A note on the Papadimitriou-Silverberg algorithm for planning optimal piecewise-linear motion of a ladder ⋮ On the complexity of a single cell in certain arrangements of surfaces related to motion planning
This page was built for publication:
