Reconstruction of Weakly Simple Polygons from Their Edges
From MaRDI portal
Publication:3177902
DOI10.1142/S021819591860004XzbMath1397.68193arXiv1610.00361OpenAlexW3101770330MaRDI QIDQ3177902
Hugo A. Akitaya, Csaba D. Tóth
Publication date: 2 August 2018
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.00361
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reconstructing polygons from scanner data
- A polygon is determined by its angles
- Connectivity augmentation in planar straight line graphs
- On embedding a cycle in a plane graph
- Triangulating a simple polygon in linear time
- On a counterexample to a conjecture of Mirzaian
- The complexity of detecting crossingfree configurations in the plane
- Segment endpoint visibility graphs are Hamiltonian
- Recognizing weakly simple polygons
- Computing Simple Circuits from a Set of Line Segments is NP-Complete
- OPTIMAL BINARY SPACE PARTITIONS FOR SEGMENTS IN THE PLANE
- Detecting Weakly Simple Polygons
This page was built for publication: Reconstruction of Weakly Simple Polygons from Their Edges
