Detecting Weakly Simple Polygons

DOI10.1137/1.9781611973730.110zbMath1371.68288arXiv1407.3340OpenAlexW3105832020MaRDI QIDQ5363019

Chao Xu, Hsien-Chih Chang, Jeff Erickson

Publication date: 5 October 2017

Published in: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (25)

Minimum Cuts in Surface Graphs ⋮ A polygonal approximation for general 4-contours corresponding to weakly simple curves ⋮ An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments ⋮ Reconstruction of Weakly Simple Polygons from Their Edges ⋮ Atomic Embeddability, Clustered Planarity, and Thickenability ⋮ On approximating shortest paths in weighted triangular tessellations ⋮ Clustered planarity with pipes ⋮ Recognizing weakly simple polygons ⋮ \(c\)-planarity of embedded cyclic \(c\)-graphs ⋮ Finding weakly simple closed quasigeodesics on polyhedral spheres ⋮ Embedding graphs into embedded graphs ⋮ Topologically trivial closed walks in directed surface graphs ⋮ Crossing minimization in perturbed drawings ⋮ Stability of intersections of graphs in the plane and the van Kampen obstruction ⋮ Crossing minimization in perturbed drawings ⋮ On approximating shortest paths in weighted triangular tessellations ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Hanani-Tutte for approximating maps of graphs ⋮ Computing the \(k\)-visibility region of a point in a polygon ⋮ Planar Matchings for Weighted Straight Skeletons ⋮ Unnamed Item ⋮ Bounded Embeddings of Graphs in the Plane ⋮ A Census of Plane Graphs with Polyline Edges ⋮ Embedding Graphs into Embedded Graphs

This page was built for publication: Detecting Weakly Simple Polygons