Sciweavers

Share
COMPGEOM
2003
ACM

Polygon decomposition based on the straight line skeleton

12 years 5 months ago
Polygon decomposition based on the straight line skeleton
We propose a novel type of decomposition for polygonal shapes. It is thought that, for the task of object recognition, the human visual system uses a part-based representation. Decompositions based on skeletons have been previously proposed in computer vision. Our method is the first one, however, based on the straight line skeleton. Compared to the medial axis, the straight line skeleton has a few advantages: it contains only straight segments and has a lower combinatorial complexity. The skeletal nodes and the way they are generated are the basis for our decomposition, which has two stages that result in a decomposition into (possibly overlapping) parts. First, a number of visually striking parts are identified, then their boundaries are successively simplified, by locally removing detail. Our method runs in time O((n + r1 + r2 2) log2 n), after the skeleton construction, where n is the number of vertices in the polygon, r1 the number of split events, and r2 the number of reflex...
Mirela Tanase, Remco C. Veltkamp
Added 05 Jul 2010
Updated 05 Jul 2010
Type Conference
Year 2003
Where COMPGEOM
Authors Mirela Tanase, Remco C. Veltkamp
Comments (0)
books