On disjoint concave chains in arrangements of (pseudo) lines
References (11)
- et al.
Topologically sweeping an arrangement
J. Comput. System Sci.
(1989) - et al.
A deterministic view of random sampling and its use in geometry
Combinatorica
(1990) - et al.
Combinatorial complexity bounds for arrangements of curves and spheres
Discrete Comput. Geom.
(1990) - et al.
Applications of random sampling in computational geometry, II
Discrete Comput. Geom.
(1989) Algorithms in Combinatorial Geometry
(1987)
There are more references available in the full text version of this article.
Cited by (9)
Erased arrangements of lines and convex decompositions of polyhedra
1998, Computational Geometry: Theory and ApplicationsOn disjoint concave chains in arrangements of (pseudo) lines
1994, Information Processing LettersDeformable free-space tilings for kinetic collision detection
2002, International Journal of Robotics ResearchOn the number of regular vertices of the union of Jordan regions
2001, Discrete and Computational GeometryPolytopes in arrangements
2001, Discrete and Computational GeometryOn levels in arrangements of lines, segments, planes, and triangles
1998, Discrete and Computational Geometry
Copyright © 1991 Published by Elsevier B.V.