Decomposition of Polygons into Convex Sets
From MaRDI portal
Publication:4176081
DOI10.1109/TC.1978.1675001zbMath0393.52001OpenAlexW2047940848MaRDI QIDQ4176081
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
Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Polytopes and polyhedra (52Bxx)
Related Items (12)
Corrections to Lee's visibility polygon algorithm ⋮ Decomposition and intersection of simple splinegons ⋮ Cooperative search by multiple unmanned aerial vehicles in a nonconvex environment ⋮ On the correctness of a linear-time visibility polygon algorithm∗ ⋮ Complexity, convexity, and unimodality ⋮ Rectangularization of digital objects and its relation with straight skeletons ⋮ Minimum k-partitioning of rectilinear polygons ⋮ Triangulating a nonconvex polytope ⋮ Algorithms for the decomposition of a polygon into convex polygons ⋮ Detecting the intersection of convex objects in the plane ⋮ A general method for decomposing self-intersecting polygon to normal based on self-intersection points ⋮ Two algorithms for constructing a Delaunay triangulation
This page was built for publication: Decomposition of Polygons into Convex Sets
