Reconstruction of the Crossing Type of a Point Set from the Compatible Exchange Graph of Noncrossing Spanning Trees
From MaRDI portal
Publication:5237063
DOI10.1007/978-3-030-14085-4_19OpenAlexW2916390933MaRDI QIDQ5237063
Publication date: 16 October 2019
Published in: Discrete Geometry for Computer Imagery (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-14085-4_19
Related Items (1)
Cites Work
- Reconstruction of the geometric structure of a set of points in the plane from its geometric tree graph
- On \(\leq k\)-edges, crossings, and halving lines of geometric drawings of \(K _{n }\)
- A quadratic distance bound on sliding between crossing-free spanning trees
- The complexity of point configurations
- Axioms and hulls
- Analytic combinatorics of non-crossing configurations
- Order on order types
- Reverse search for enumeration
- The rectilinear local crossing number of \(K_{n}\)
- On the number of plane geometric graphs
- Approximating the Maximum Rectilinear Crossing Number
- Counting Plane Graphs: Flippability and Its Applications
- Approximating the Rectilinear Crossing Number
- An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings
- The Complexity of Order Type Isomorphism
- Enumeration of simple complete topological graphs
- Transition operations over plane trees
This page was built for publication: Reconstruction of the Crossing Type of a Point Set from the Compatible Exchange Graph of Noncrossing Spanning Trees
