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

DOI10.1016/J.TCS.2020.07.040MaRDI QIDQ2006782zbMATH OpenOpenAlexFDO

Authors Yong Cui, Qian Liu, Guo Chen, Hujun Zhang

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

decompositionself-intersectionsplittingpolygon

Mathematics Subject Classification ID

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

Recommendations

• Decomposition and intersection of simple splinegons
• Self-intersecting polygons resulting from contour evolution for shape similarity
• Detecting and decomposing self-overlapping curves
• SignedIntersection -- a new algorithm for finding the intersection of two simple polygons
• A Linear Time Heuristics for Trapezoidation of GIS Polygons

Cites work

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

Cited in

(1)

• Point in polygon problem via homotopy and Hopf's degree theorem

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

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