A note on universal point sets for planar graphs
From MaRDI portal
Publication:2206869
DOI10.1007/978-3-030-35802-0_27OpenAlexW2991434353MaRDI QIDQ2206869
Raphael Steiner, Manfred Scheucher, Hendrik Schrezenmaier
Publication date: 26 October 2020
Full work available at URL: https://arxiv.org/abs/1811.06482
order typeinteger programming (IP)Boolean satisfiability (SAT)simultaneously embeddedstacked triangulation
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (3)
A Note on Universal Point Sets for Planar Graphs ⋮ Faradžev Read-type enumeration of non-isomorphic CC systems ⋮ Wiener Index and Remoteness in Triangulations and Quadrangulations
Cites Work
- Unnamed Item
- Unnamed Item
- How to draw a planar graph on a grid
- A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs
- On simultaneous planar graph embeddings
- Abstract order type extension and new results on the rectilinear crossing number
- Enumerating order types for small point sets with applications
- Universal point sets for planar three-trees
- Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\)
- Practical graph isomorphism. II.
- Drawing Planar Graphs on Area
- Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
- Theory and Applications of Satisfiability Testing
- Superpatterns and Universal Point Sets
- On Universal Point Sets for Planar Graphs
- Sweeps, arrangements and signotopes
This page was built for publication: A note on universal point sets for planar graphs
