Sciweavers

31 search results - page 7 / 7
» ijcga 2006
Sort
View
64
Voted
IJCGA
1998
74views more  IJCGA 1998»
14 years 10 months ago
Polyhedral Assembly Partitioning Using Maximally Covered Cells in Arrangements of Convex Polytopes
We study the following problem: Given a collection A of polyhedral parts in 3D, determine whether there exists a subset S of the parts that can be moved as a rigid body by in nite...
Leonidas J. Guibas, Dan Halperin, Hirohisa Hirukaw...