ICRA
1994
IEEE
13 years 9 months ago
1994
IEEE
This paper describes an efficient algorithm for computing the distance between non-convex objects. Objects are modeled as the union of a set of convex components. From this model ...
COMPGEOM
2004
ACM
13 years 10 months ago
2004
ACM
We propose a strategy to decompose a polygon, containing zero or more holes, into “approximately convex” pieces. For many applications, the approximately convex components of ...