ACCORD: With approximate covering of convex orthogonal decomposition

DOI10.1007/978-3-642-19867-0_41zbMATH Open1272.68431OpenAlexW1593004613MaRDI QIDQ3000730FDOQ3000730

Partha Bhowmick, Mousumi Dutt, Arindam Biswas

Publication date: 19 May 2011

Published in: Discrete Geometry for Computer Imagery (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-19867-0_41

Recommendations

• Approximate convex decomposition of polygons
• Approximate convex decomposition of polygons
• A linear time combinatorial algorithm to compute the relative orthogonal convex hull of digital objects
• Morphological decomposition of 2-D binary shapes into convex polygons: a heuristic algorithm
• Approximate convex decomposition of polyhedra and its applications

zbMATH Keywords

image analysisconvex decompositionpolygon decompositionconvex componentrectangular component

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10)

Cited In (1)

• Shape decomposition algorithms for laser capture microdissection

This page was built for publication: ACCORD: With approximate covering of convex orthogonal decomposition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3000730)