67 search results - page 4 / 14 » Approximate convex decomposition of polygons |
IWVF
2001
Springer
15 years 4 months ago
2001
Springer
The paper introduces a new approximation scheme for planar digital curves. This scheme defines an approximating sausage ‘around’ the given digital curve, and calculates a mini...
COMPGEOM
2004
ACM
15 years 5 months ago
2004
ACM
STACS
1990
Springer
15 years 3 months ago
1990
Springer
We consider the problem of approximating a convex gure in the plane by a pair (r; R) of homothetic (that is, similar and parallel) rectangles with r C R. We show the existenc...
SIAMJO
2011
14 years 6 months ago
2011
Abstract. We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, bu...
CCCG
2010
15 years 1 months ago
2010
Assume that two points p and q are given and a finite ordered set of simple polygons, all in the same plane; the basic version of a touring-a-sequence-of-polygons problem (TPP) is...