52 search results - page 2 / 11 » Decomposing a simple polygon into pseudo-triangles and conve... |
JCDCG
2000
Springer
13 years 11 months ago
2000
Springer
A k-dissection D of a polygon P, is a partition of P into a set of subpolygons {Q1, . . . , Qm} with disjoint interiors such that these can be reassembled to form k polygons P1, ....
ESA
2000
Springer
13 years 11 months ago
2000
Springer
Several algorithms for computing the Minkowski sum of two polygons in the plane begin by decomposing each polygon into convex subpolygons. We examine different methods for decompo...
COCOON
2006
Springer
13 years 11 months ago
2006
Springer
We present a simple O(m+n6 / 12 ) time (1+ )-approximation algorithm for the problem of cutting a convex n-gon out of a convex m-gon with line cuts of minimum total cutting length....
ICRA
1999
IEEE
13 years 11 months ago
1999
IEEE
The vibratory bowl feeder is the oldest and still most common approach to the automated feeding (orienting) of industrial parts. In this paper we consider a class of vibratory bow...
IJRR
2010
13 years 6 months ago
2010
In this paper, we examine non-stretchable 2D polygonal cloth, and place bounds on the number of fingers needed to immobilize it. For any non-stretchable cloth polygon, it is alwa...