Order on order types
From MaRDI portal
Publication:1650795
DOI10.1007/s00454-017-9912-9zbMath1394.52029DBLPjournals/dcg/PilzW18OpenAlexW2738991358WikidataQ54308450 ScholiaQ54308450MaRDI QIDQ1650795
Publication date: 13 July 2018
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-017-9912-9
Related Items (2)
Reconstruction of the crossing type of a point set from the compatible exchange graph of noncrossing spanning trees ⋮ Reconstruction of the Crossing Type of a Point Set from the Compatible Exchange Graph of Noncrossing Spanning Trees
Cites Work
- Unnamed Item
- Crossing numbers of graphs with rotation systems
- Teilungen der Ebenen durch Geraden oder topologische Geraden
- Semispaces of configurations, cell complexes of arrangements
- Abstract order type extension and new results on the rectilinear crossing number
- Proof of a conjecture of Burr, Grünbaum, and Sloane
- Crossing families
- Towards compatible triangulations.
- Enumerating order types for small point sets with applications
- On the number of plane geometric graphs
- Partitions of complete geometric graphs into plane trees
- Packing plane spanning trees and paths in complete geometric graphs
- Reconstructing Point Set Order Typesfrom Radial Orderings
- Multidimensional Sorting
- An improved lower bound on the minimum number of triangulations
- An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings
- Complexity of Some Geometric and Topological Problems
- Congruent Graphs and the Connectivity of Graphs
- POINT AND LINE SEGMENT RECONSTRUCTION FROM VISIBILITY INFORMATION
- Order on Order Types
- On Universal Point Sets for Planar Graphs
- Enumeration of simple complete topological graphs
This page was built for publication: Order on order types
