Minimal Representations of Order Types by Geometric Graphs
From MaRDI portal
Publication:5141642
DOI10.7155/jgaa.00545zbMath1451.05220arXiv1908.05124OpenAlexW2967208091MaRDI QIDQ5141642
No author found.
Publication date: 18 December 2020
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1908.05124
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Unnamed Item
- Unnamed Item
- Teilungen der Ebenen durch Geraden oder topologische Geraden
- The power of geometric duality
- Arrangements of lines and pseudolines without adjacent triangles
- On the coordinatization of oriented matroids
- A theorem on higher Bruhat orders
- Multidimensional Sorting
- The best polynomial bounds for the number of triangles in a simple arrangement of n pseudo-lines
- Arrangements of Lines with a Large Number of Triangles
- Constructing Arrangements of Lines and Hyperplanes with Applications
- Empty Simplices in Euclidean Space
- Subquadratic encodings for point configurations
- Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
- How to Morph Planar Graph Drawings
- The Utility of Untangling
