On L-shaped point set embeddings of trees: first non-embeddable examples

DOI10.1007/978-3-030-04414-5_25OpenAlexW2884586647MaRDI QIDQ1725769

Manfred Scheucher, Torsten Mütze

Publication date: 15 February 2019

Full work available at URL: https://arxiv.org/abs/1807.11043

zbMATH Keywords

treeSATpoint setL-shaped embedding

Mathematics Subject Classification ID

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

Related Items (3)

On L-shaped point set embeddings of trees: first non-embeddable examples ⋮ Rollercoasters: Long Sequences without Short Runs ⋮ On L-shaped point set embeddings of trees: first non-embeddable examples

Cites Work

• Unnamed Item
• On L-shaped point set embeddings of trees: first non-embeddable examples
• Orthogeodesic point-set embedding of trees
• Manhattan-Geodesic Embedding of Planar Graphs
• Improved Bounds for Drawing Trees on Fixed Points with L-Shaped Edges
• Geometric Graphs in the Plane Lattice
• Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles

This page was built for publication: On L-shaped point set embeddings of trees: first non-embeddable examples