67 search results - page 2 / 14 » Approximate convex decomposition of polygons |
IPL
2002
14 years 9 months ago
2002
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...
COMGEO
2006
ACM
14 years 9 months ago
2006
ACM
112
Voted
ISAAC
2009
Springer
15 years 4 months ago
2009
Springer
We introduce a new probing problem: what is the minimum number of cameras at fixed positions necessary and sufficient to reconstruct any strictly convex polygon contained in a dis...
DGCI
2009
Springer
15 years 24 days 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...
71
Voted
CVPR
2010
IEEE
15 years 5 months ago
2010
IEEE
In this paper, we propose a new shape decomposition method, called convex shape decomposition. We formalize the convex decomposition problem as an integer linear programming probl...