6 search results - page 1 / 2 » On the exact maximum complexity of Minkowski sums of convex ... |
COMPGEOM
2007
ACM
13 years 11 months ago
2007
ACM
SMA
2010
ACM
13 years 7 months ago
2010
ACM
We present a novel method for fast retrieval of exact Minkowski sums of pairs of convex polytopes in R3 , where one of the polytopes keeps rotating. The algorithm is based on pre-...
COMPGEOM
2005
ACM
13 years 9 months ago
2005
ACM
PG
2007
IEEE
14 years 1 months ago
2007
IEEE
Minkowski sum is a fundamental operation in many geometric applications, including robotics, penetration depth estimation, solid modeling, and virtual prototyping. However, due to...
COMPGEOM
2006
ACM
14 years 1 months ago
2006
ACM
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...