Polygon decomposition based on the straight line skeleton

@inproceedings{Tanase2003PolygonDB,
  title={Polygon decomposition based on the straight line skeleton},
  author={Mirela Tanase and Remco C. Veltkamp},
  booktitle={SCG '03},
  year={2003}
}
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… 
Shape decomposition and retrieval
This thesis is about geometric algorithms for shape-based image retrieval. The shapes we consider are 2-D contours forming the boundaries of objects and regions of interest in an image. In order to
A Straight Skeleton Approximating the Medial Axis
TLDR
The notion of e-Equivalence between two skeletons is introduced, and an algorithm that computes the number of zero-length edges for each reflex vertex which yield a linear axis e-equivalent to the medial axis is given.
Straight Skeletons of Three-Dimensional Polyhedra
TLDR
It is proved that the skeleton of a general polyhedron has a superquadratic complexity in the worst case and an implementation of an algorithm for the general case is reported.
Dual-Space Decomposition of 2D Complex Shapes
TLDR
A new decomposition method is proposed, called Dual-space Decomposition that handles complex 2D shapes by recognizing the importance of holes and classifying holes as either topological noise or structurally important features.
Approximate convex decomposition of polygons
TLDR
This work proposes a simple algorithm that computes an ACD of a polygon by iteratively removing the most significant non-convex feature (notch) and produces an elegant hierarchical representation that provides a series of `increasingly convex' decompositions.
New Framework for Decomposing a Polygon with Zero or More Holes
In this paper, we propose a unified framework for decomposition of a polygon with or without holes, enlight- ened by approximate convex decomposition. We transform target polygon containing holes
alpha-Decomposition of polygons
Near-convex decomposition of 2D shape using visibility range
Skeleton Computation of an Image Using a Geometric Approach
TLDR
This work develops two algorithms to compute the skeleton of a binary 2D image which is an orthogonal polygon and processes the edges of the polygon while the other one uses its vertices.
...
1
2
3
4
...

References

SHOWING 1-10 OF 25 REFERENCES
Straight Skeletons for General Polygonal Figures in the Plane
TLDR
It is shown that the concept of S(G) is exible enough to allow an individual weighting of the edges and vertices of G, without changes in the maximal size ofS(G), or in the method of construction.
2D Shape Decomposition and the Automatic Generation of Hierarchical Representations
TLDR
This paper presents a framework for automatically generating hierarchical 2D object representations specialized for geometric tasks by constructing a multi-resolution representation that encapsulates the salient geometric features of an object, as well as its topological decomposition into parts.
Parts of Visual Form: Computational Aspects
TLDR
Computational support for the limb-based and neck-based parts is presented by showing that they are invariant, robust, stable and yield a hierarchy of parts.
Straight Skeleton Implementation
Straight s k eleton Angular Bisector Network, ABN of a planar polygon, which can be grasped as a modiication of a planar Voronoi diagram without parabolic arcs, has been successfully used by O l i v
Part-based shape retrieval
TLDR
A measure for computing the Dissimilarity between multiple polylines and a polygon based on the turning function is introduced, and a part-based retrieval system using that dissimilarity measure is described.
Hierarchic Voronoi skeletons
Convexity Rule for Shape Decomposition Based on Discrete Contour Evolution
TLDR
A novel rule is obtained, called the hierarchical convexity rule, which states that visual parts are enclosed by maximal convex (with respect to the object) boundary arcs at different stages of the contour evolution.
An efficiently computable metric for comparing polygonal shapes
A method for comparing polygons that is a metric, invariant under translation, rotation, and change of scale, reasonably easy to compute, and intuitive is presented. The method is based on the L/sub
Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations
TLDR
This work gives new methods for maintaining a data structure that supports ray-shooting and shortest-path queries in a dynamically changing connected planar subdivision S, and outperforms the previous best data structure for this problem by a lognfactor in all the complexity measures.
Raising roofs, crashing cycles, and playing pool: applications of a data structure for finding pairwise interactions
TLDR
The straight skeleton of an n -gon with r reflex vertices is constructed in time O(n 1+e + n 8/11+e r 9/11-e ) , for any fixed e >0, improving the previous best upper bound of O(nr log n) .
...
1
2
3
...