Universal point sets for planar three-trees
From MaRDI portal
Publication:2253908
DOI10.1016/j.jda.2014.12.005zbMath1320.68212OpenAlexW2090891537MaRDI QIDQ2253908
Publication date: 13 February 2015
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2014.12.005
Trees (05C05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (3)
A Note on Universal Point Sets for Planar Graphs ⋮ A note on universal point sets for planar graphs ⋮ Small universal point sets for \(k\)-outerplanar graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Point-set embeddings of plane \(3\)-trees
- Lower bounds for weak epsilon-nets and stair-convexity
- Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs
- Small grid drawings of planar graphs with balanced partition
- On point-sets that support planar graphs
- 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
- Universal sets of \(n\) points for one-bend drawings of planar graphs with \(n\) vertices
- Small area drawings of outerplanar graphs
- On embedding an outer-planar graph in a point set
- Plane 3-trees: Embeddability and Approximation
- Superpatterns and Universal Point Sets
- THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE GRAPHS
- Universal Line-Sets for Drawing Planar 3-Trees
- On the Hardness of Point-Set Embeddability
- Embedding Plane 3-Trees in ℝ2 and ℝ3
- Small Point Sets for Simply-Nested Planar Graphs
- Drawing Planar Graphs on Area
- Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
- A Note on Minimum-Area Straight-Line Drawings of Planar Graphs
This page was built for publication: Universal point sets for planar three-trees
