Minimal representations of order types by geometric graphs

DOI10.1007/978-3-030-35802-0_8OpenAlexW2991575212MaRDI QIDQ2206835

Yanyan Li

Publication date: 26 October 2020

Full work available at URL: http://hdl.handle.net/20.500.11850/463986

zbMATH Keywords

geometric graphorder typepseudoline arrangementstraight-line drawingtriangular cell

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Complete graph drawings up to triangle mutations ⋮ Clique-width of point configurations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Teilungen der Ebenen durch Geraden oder topologische Geraden
• On the number of triangles in simple arrangements of pseudolines in the real projective plane
• 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
• 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