An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings
From MaRDI portal
Publication:5370571
DOI10.1142/S0218195917600044zbMath1372.68248MaRDI QIDQ5370571
Oswin Aichholzer, Vincent J. J. Kusters, Manuel Wettstein, Alexander Pilz, Wolfgang Mulzer
Publication date: 20 October 2017
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Related Items
Reconstruction of the crossing type of a point set from the compatible exchange graph of noncrossing spanning trees, Clique-width of point configurations, Reconstruction of the Crossing Type of a Point Set from the Compatible Exchange Graph of Noncrossing Spanning Trees
Cites Work
- Unnamed Item
- Unnamed Item
- An improved algorithm for reconstructing a simple polygon from its visibility angles
- Simple realizability of complete abstract topological graphs in P
- Semispaces of configurations, cell complexes of arrangements
- The power of geometric duality
- Proof of a conjecture of Burr, Grünbaum, and Sloane
- Axioms and hulls
- Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\)
- Reconstructing Point Set Order Typesfrom Radial Orderings
- Simple Realizability of Complete Abstract Topological Graphs Simplified
- Complexity of Some Geometric and Topological Problems
- Reconstructing a Simple Polygon from Its Angles
- Constructing Arrangements of Lines and Hyperplanes with Applications
- POINT AND LINE SEGMENT RECONSTRUCTION FROM VISIBILITY INFORMATION
- Order on Order Types
- Visibility Algorithms in the Plane
- Graph-Theoretic Concepts in Computer Science
- Sweeps, arrangements and signotopes
