A general method for decomposing self-intersecting polygon to normal based on self-intersection points

DOI10.1016/j.tcs.2020.07.040zbMath1455.68229OpenAlexW3046969634MaRDI QIDQ2006782

Qian Liu, Guo Chen, Hujun Zhang, Yong Cui

Publication date: 12 October 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2020.07.040

zbMATH Keywords

decompositionpolygonsplittingself-intersection

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Decomposing a simple polygon into pseudo-triangles and convex polygons
• Equal-area locus-based convex polygon decomposition
• Approximation algorithms for decomposing octilinear polygons
• Approximate convex decomposition of polygons
• Reentrant polygon clipping
• Plane-sweep algorithms for intersecting geometric figures
• A new, fast method for 2D polygon clipping
• Decomposition of Polygons into Convex Sets
• Polygon decomposition for efficient construction of Minkowski sums

This page was built for publication: A general method for decomposing self-intersecting polygon to normal based on self-intersection points