ACCORD: with approximate covering of convex orthogonal decomposition

Authors:
Mousumi Dutt;Arindam Biswas;Partha Bhowmick
Affiliations:
Department of Information Technology, Bengal Engineering and Science University, Shibpur, Howrah, India;Department of Information Technology, Bengal Engineering and Science University, Shibpur, Howrah, India;Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur, India
Venue:
DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
Year:
2011

Citing 12
Cited 1

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
Geometric reasoning for machining features using convex decomposition

SMA '93 Proceedings on the second ACM symposium on Solid modeling and applications
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
Decomposition of Polygons into Simpler Components: Feature Generation for Syntactic Pattern Recognition

IEEE Transactions on Computers
Approximate convex decomposition of polygons

Computational Geometry: Theory and Applications
TIPS: on finding a tight isothetic polygonal shape covering a 2d object

SCIA'05 Proceedings of the 14th Scandinavian conference on Image Analysis

Approximate partitioning of 2D objects into orthogonally convex components

Computer Vision and Image Understanding

Quantified Score

Hi-index	0.00

Visualization

Abstract

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(n log n) time for a hole-free object whose boundary consists of n pixels. 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. Experimental results on different shapes have been presented to demonstrate the efficacy, elegance, and robustness of the proposed technique.