Recognizing weakly simple polygons

DOI10.4230/LIPIcs.SoCG.2016.8zbMath1387.68230arXiv1603.07401OpenAlexW2762324796MaRDI QIDQ3132840

Hugo A. Akitaya, Jeff Erickson, Greg Aloupis, Csaba D. Tóth

Publication date: 30 January 2018

Full work available at URL: https://arxiv.org/abs/1603.07401

zbMATH Keywords

weakly simple polygoncrossing

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial complexity of geometric structures (52C45)

Related Items (4)

\(c\)-planarity of embedded cyclic \(c\)-graphs ⋮ Stability of intersections of graphs in the plane and the van Kampen obstruction ⋮ Hanani-Tutte for approximating maps of graphs ⋮ Embedding Graphs into Embedded Graphs

This page was built for publication: Recognizing weakly simple polygons