An Efficiently Computable Metric for Comparing Polygonal Shapes
IEEE Transactions on Pattern Analysis and Machine Intelligence
Parts of Visual Form: Computational Aspects
IEEE Transactions on Pattern Analysis and Machine Intelligence
International Journal of Computer Vision
Convexity rule for shape decomposition based on discrete contour evolution
Computer Vision and Image Understanding
Shock Graphs and Shape Matching
International Journal of Computer Vision
Motorcycle graphs and straight skeletons
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Straight Skeletons for General Polygonal Figures in the Plane
COCOON '96 Proceedings of the Second Annual International Conference on Computing and Combinatorics
Approximate convex decomposition of polygons
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Delaunay triangulations approximate anchor hulls
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Approximate convex decomposition of polygons
Computational Geometry: Theory and Applications
Delaunay triangulations approximate anchor hulls
Computational Geometry: Theory and Applications
Straight Skeletons of Three-Dimensional Polyhedra
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
2D Shape Decomposition Based on Combined Skeleton-Boundary Features
ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing, Part II
Morphological multiscale decomposition of connected regions with emphasis on cell clusters
Computer Vision and Image Understanding
Straight skeletons of three-dimensional polyhedra
Proceedings of the twenty-fifth annual symposium on Computational geometry
On the decomposition of cell clusters
Journal of Mathematical Imaging and Vision
Approximate convex decomposition of polygons
Computational Geometry: Theory and Applications
Distance functions and skeletal representations of rigid and non-rigid planar shapes
Computer-Aided Design
Generating realistic roofs over a rectilinear polygon
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
SMI 2012: Full α-Decomposition of polygons
Computers and Graphics
Fast approximate convex decomposition using relative concavity
Computer-Aided Design
Perceptually friendly shape decomposition by resolving segmentation points with minimum cost
Journal of Visual Communication and Image Representation
Realistic roofs over a rectilinear polygon
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
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 ((n+r1+r22)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 edge annihilations. The decomposition is invariant to rigid motions and uniform scalings. We present results indicating that it provides plausible decompositions for a variety of shapes. This makes it attractive for partial shape matching in content-based image retrieval.