Partitioning a polygonal region into trapezoids
Journal of the ACM (JACM)
Minimally covering a horizontally convex orthogonal polygon
SCG '86 Proceedings of the second annual symposium on Computational geometry
Covering a simple orthogonal polygon with a minimum number of orthogonally convex polygons
SCG '87 Proceedings of the third annual symposium on Computational geometry
Perfect graphs and orthogonally convex covers
SIAM Journal on Discrete Mathematics
Orthogonally convex coverings of orthogonal polygons without holes
Journal of Computer and System Sciences
The Power of Non-Rectilinear Holes
Proceedings of the 9th Colloquium on Automata, Languages and Programming
Minimum Convex Partition of a Polygon with Holes by Cuts in Given Directions
ISAAC '96 Proceedings of the 7th International Symposium on Algorithms and Computation
Bounds on the Length of Convex Partitions of Polygons
Proceedings of the Fourth Conference on Foundations of Software Technology and Theoretical Computer Science
Decomposing a polygon into its convex parts
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Approximate convex decomposition of polygons
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
IEEE Transactions on Computers
Decomposition of Polygons into Convex Sets
IEEE Transactions on Computers
Reeb graphs for shape analysis and applications
Theoretical Computer Science
A theorem on polygon cutting with applications
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Path Similarity Skeleton Graph Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
A Graph-Based Approach for Shape Skeleton Analysis
ICIAP '09 Proceedings of the 15th International Conference on Image Analysis and Processing
Approximate convex decomposition of polygons
Computational Geometry: Theory and Applications
Construction of isothetic covers of a digital object: A combinatorial approach
Journal of Visual Communication and Image Representation
A Linear-time Algorithm for the Generation of Random Digital Curves
PSIVT '10 Proceedings of the 2010 Fourth Pacific-Rim Symposium on Image and Video Technology
ACCORD: with approximate covering of convex orthogonal decomposition
DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
TIPS: on finding a tight isothetic polygonal shape covering a 2d object
SCIA'05 Proceedings of the 14th Scandinavian conference on Image Analysis
Topological and geometrical reconstruction of complex objects on irregular isothetic grids
DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
Some NP-hard polygon decomposition problems
IEEE Transactions on Information Theory
Fast algorithm for polygon decomposition
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Hi-index | 0.00 |
A fast and efficient algorithm to obtain an orthogonally convex decomposition of a digital object is presented. The algorithm reports a sub-optimal solution and runs in O(nlogn) time for a hole-free object whose boundary consists of n pixels. The decomposition algorithm can, in fact, be applied on any hole-free orthogonal polygon; in our work, it is applied on the inner isothetic cover of the concerned digital object. The approximate/rough decomposition of the object is achieved by partitioning the inner cover (an orthogonal polygon) of the object into a set of orthogonal convex components. A set of rules is formulated based on the combinatorial cases and the decomposition is obtained by applying these rules while considering the concavities of the inner cover. The rule formulation is based on certain theoretical properties apropos the arrangement of concavities, which are also explained in this paper. Experimental results on different shapes have been presented to demonstrate the efficacy, elegance, and robustness of the proposed technique.