Approximate convex decomposition of polygons

DOI10.1016/j.comgeo.2005.10.005zbMath1101.52300OpenAlexW2202245204WikidataQ56863767 ScholiaQ56863767MaRDI QIDQ2507162

Jyh-Ming Lien, Nancy M. Amato

Publication date: 10 October 2006

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2005.10.005

zbMATH Keywords

polygonhierarchicalconvex decomposition

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation by convex sets (52A27)

Related Items (10)

Fast and reliable transient simulation and continuous optimization of large-scale gas networks ⋮ Minimum K-Adjacent Rectangles of Orthogonal Polygons and its Application ⋮ Convex Partitions with 2-Edge Connected Dual Graphs ⋮ SFCDecomp: Multicriteria Optimized Tool Path Planning in 3D Printing using Space-Filling Curve Based Domain Decomposition ⋮ Rectangularization of digital objects and its relation with straight skeletons ⋮ Convex partitions with 2-edge connected dual graphs ⋮ Weighted skeletons and fixed-share decomposition ⋮ A general method for decomposing self-intersecting polygon to normal based on self-intersection points ⋮ A new area-based convexity measure with distance weighted area integration for planar shapes ⋮ Constructing IGA-suitable planar parameterization from complex CAD boundary by domain partition and global/local optimization

Uses Software

• FIST
• SegMatch

Cites Work

• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• A linear algorithm for finding the convex hull of a simple polygon
• Triangulating a simple polygon in linear time
• Finding the medial axis of a simple polygon in linear time
• 2D SHAPE DECOMPOSITION AND THE AUTOMATIC GENERATION OF HIERARCHICAL REPRESENTATIONS
• Euclidean shortest paths in the presence of rectilinear barriers
• Decomposing a Polygon into Simpler Components
• Decomposition of Polygons into Simpler Components: Feature Generation for Syntactic Pattern Recognition
• Polygonal entropy: A convexity measure
• Polygon Area Decomposition for Multiple-Robot Workspace Division
• Linear-time triangulation of a simple polygon made easier via randomization
• Polygon decomposition based on the straight line skeleton
• Measuring Concavity on a Rectangular Mosaic
• Algorithms and Data Structures
• FIST: fast industrial-strength triangulation of polygons
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximate convex decomposition of polygons