895 search results - page 1 / 179 » Approximate convex decomposition |
COMPGEOM
2004
ACM
13 years 10 months ago
2004
ACM
We propose a strategy to decompose a polygon, containing zero or more holes, into “approximately convex” pieces. For many applications, the approximately convex components of ...
INFOCOM
2012
IEEE
11 years 7 months ago
2012
IEEE
—Accurate localization in wireless sensor networks is the foundation for many applications, such as geographic routing and position-aware data processing. An important research d...
CVPR
2010
IEEE
14 years 1 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...
COMPGEOM
2004
ACM
13 years 10 months ago
2004
ACM
SIAMJO
2011
13 years 8 days 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...