23 search results - page 1 / 5 » Minimum Area Convex Packing of Two Convex Polygons |
IJCGA
2006
13 years 11 months ago
2006
ALGORITHMICA
1998
13 years 10 months ago
1998
Abstract. We study some minimum-area hull problems that generalize the notion of convex hull to starshaped and monotone hulls. Specifically, we consider the minimum-area star-shap...
COCOON
2006
Springer
14 years 2 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....
DGCI
2009
Springer
14 years 2 months ago
2009
Springer
The Minimum Length Polygon (MLP) is an interesting first order approximation of a digital contour. For instance, the convexity of the MLP is characteristic of the digital convexit...
COMGEO
2008
ACM
13 years 10 months ago
2008
ACM
In this paper we consider the problem of decomposing a simple polygon into subpolygons that exclusively use vertices of the given polygon. We allow two types of subpolygons: pseud...