279 search results - page 2 / 56 » Implicit Convex Polygons |
COMGEO
2008
ACM
13 years 6 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...
COCOON
2006
Springer
13 years 10 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....
JCIT
2007
13 years 6 months ago
2007
Based on the planar polygon shape classification, we propose a method—Standardized Binary String Descriptor of Convex Polygon—for classification of convex polygons, making it ...
ICPR
2004
IEEE
14 years 8 months ago
2004
IEEE
A new area-based convexity measure for polygons is described. It has the desirable properties that it is not sensitive to small boundary defects, and it is symmetric with respect ...
ADCM
2010
13 years 7 months ago
2010
Wachspress and mean value coordinates are two generalizations of triangular barycentric coordinates to convex polygons and have recently been used to construct mappings between po...