The union of congruent cubes in three dimensions

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2001, Pages 19-28

  Pach, J ^a   Safruti, I ^a   Sharir, M ^a  

^a CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; THEOREM PROVING;

COMBINATORILY COMPLEXITY; POINT SETS; TRIHEDRAL WEDGES;

SET THEORY;

EID: 0034833909     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/378583.378598     Document Type: Conference Paper

References (15)

1. Pipes, cigars, and kreplach: The union of Minkowski sums in three dimensions
2. Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
3. On translational motion planning of a convex polyhedron in 3-space
4. The union of convex polyhedra in three dimensions
5. Voronoi diagrams in higher dimensions under certain polyhedral distance functions
6. Applications of random sampling in computational geometry II
7. The complexity of the union of (α, β)-covered objects
8. On the union of α-curved objects
9. On the union of fat wedges and separating a collection of segments by a line
10. The complexity of the union of fat objects in the plane
11. On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
12. On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal space
13. Fat triangles determine linearly many holes
14. On the Boundary complexity of the union of fat triangles