An optimal algorithm for reconstructing point set order types from radial orderings

DOI10.1142/S0218195917600044MaRDI QIDQ5370571zbMATH OpenFDO

Authors Oswin Aichholzer, Vincent J. J. Kusters, Wolfgang Mulzer, Alexander Pilz, Manuel Wettstein

Publication date 20 October 2017

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0218195917600044

zbMATH Keywords

abstract order typegood drawingpoint setradial system

Mathematics Subject Classification ID

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

Recommendations

• An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings
• Reconstructing Point Set Order Types from Radial Orderings
• Reconstructing point set order types from radial orderings
• On the number of radial orderings of planar point sets.
• The Complexity of Order Type Isomorphism

Cites work

• An improved algorithm for reconstructing a simple polygon from its visibility angles
• Axioms and hulls
• Complexity of some geometric and topological problems
• Constructing Arrangements of Lines and Hyperplanes with Applications
• Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\)
• Graph-Theoretic Concepts in Computer Science
• scientific article; zbMATH DE number 4092241 (Why is no real title available?)
• scientific article; zbMATH DE number 5250979 (Why is no real title available?)
• Order on order types
• POINT AND LINE SEGMENT RECONSTRUCTION FROM VISIBILITY INFORMATION
• Proof of a conjecture of Burr, Grünbaum, and Sloane
• Reconstructing a simple polygon from its angles
• Reconstructing point set order types from radial orderings
• Semispaces of configurations, cell complexes of arrangements
• Simple realizability of complete abstract topological graphs in P
• Simple realizability of complete abstract topological graphs simplified
• Sweeps, arrangements and signotopes
• The power of geometric duality
• Visibility Algorithms in the Plane

Cited in

(10)

• Reconstruction of the crossing type of a point set from the compatible exchange graph of noncrossing spanning trees
• Extreme point and halving edge search in abstract order types
• Reconstructing point set order types from radial orderings
• Reconstructing Point Set Order Types from Radial Orderings
• An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings
• On the number of radial orderings of colored planar point sets
• On the number of radial orderings of planar point sets.
• Reconstruction of the crossing type of a point set from the compatible exchange graph of noncrossing spanning trees
• Clique-width of point configurations
• Testing the planar straight-line realizability of 2-trees with prescribed edge lengths

This page was built for publication: An optimal algorithm for reconstructing point set order types from radial orderings

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