The Union of Convex Polyhedra in Three Dimensions
- 1 December 1997
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 26 (6) , 1670-1688
- https://doi.org/10.1137/s0097539793250755
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- On Translational Motion Planning of a Convex Polyhedron in 3-SpaceSIAM Journal on Computing, 1997
- The common exterior of convex polygons in the planeComputational Geometry, 1997
- Castles in the air revisitedDiscrete & Computational Geometry, 1994
- On the sum of squares of cell complexities in hyperplane arrangementsJournal of Combinatorial Theory, Series A, 1994
- Computing a Face in an Arrangement of Line Segments and Related ProblemsSIAM Journal on Computing, 1993
- On the zone of a surface in a hyperplane arrangementDiscrete & Computational Geometry, 1993
- An Optimal Algorithm for Intersecting Three-Dimensional Convex PolyhedraSIAM Journal on Computing, 1992
- Applications of random sampling to on-line algorithms in computational geometryDiscrete & Computational Geometry, 1992
- Triangles in space or building (and analyzing) castles in the airCombinatorica, 1990
- Applications of random sampling in computational geometry, IIDiscrete & Computational Geometry, 1989