The union of convex polyhedra in three dimensions
- 30 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Fat Triangles Determine Linearly Many HolesSIAM Journal on Computing, 1994
- On the Zone Theorem for Hyperplane ArrangementsSIAM Journal on Computing, 1993
- On the zone of a surface in a hyperplane arrangementDiscrete & Computational Geometry, 1993
- New bounds for lower envelopes in three dimensions, with applications to visibility in terrainsPublished by Association for Computing Machinery (ACM) ,1993
- Randomized incremental construction of Delaunay and Voronoi diagramsAlgorithmica, 1992
- Onk-sets in arrangements of curves and surfacesDiscrete & Computational Geometry, 1991
- Triangles in space or building (and analyzing) castles in the airCombinatorica, 1990
- The complexity and construction of many faces in arrangements of lines and of segmentsDiscrete & Computational Geometry, 1990
- Algorithms in Combinatorial GeometryPublished by Springer Nature ,1987
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstaclesDiscrete & Computational Geometry, 1986