Decomposition of Polygons into Convex Sets

DOI10.1109/TC.1978.1675001MaRDI QIDQ4176081zbMATH OpenOpenAlexFDO

Authors Bruce J. Schachter

Publication date 1978

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.1978.1675001

zbMATH Keywords

Decomposition of PolygonsDelaunay TessellationPattern Recognition

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Polytopes and polyhedra (52Bxx)

Cited in

(13)

• Corrections to Lee's visibility polygon algorithm
• Decomposition and intersection of simple splinegons
• Detecting the intersection of convex objects in the plane
• Cooperative search by multiple unmanned aerial vehicles in a nonconvex environment
• Algorithms for the decomposition of a polygon into convex polygons
• A general method for decomposing self-intersecting polygon to normal based on self-intersection points
• Complexity, convexity, and unimodality
• Two algorithms for constructing a Delaunay triangulation
• On the correctness of a linear-time visibility polygon algorithm^∗
• Rectangularization of digital objects and its relation with straight skeletons
• Minimum star partitions of simple polygons in polynomial time
• Minimum k-partitioning of rectilinear polygons
• Triangulating a nonconvex polytope

This page was built for publication: Decomposition of Polygons into Convex Sets

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