Improved Bounds for Drawing Trees on Fixed Points with L-Shaped Edges

DOI10.1007/978-3-319-73915-1_24zbMath1503.68207arXiv1709.01456OpenAlexW2752712482MaRDI QIDQ4625119

Martin Derka, Anna Lubiw, Timothy M. Chan, Kshitij Jain, Therese C. Biedl

Publication date: 20 February 2019

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (7)

Longest common rollercoasters ⋮ On L-shaped point set embeddings of trees: first non-embeddable examples ⋮ Rollercoasters and Caterpillars ⋮ Unnamed Item ⋮ Rollercoasters: Long Sequences without Short Runs ⋮ On L-shaped point set embeddings of trees: first non-embeddable examples ⋮ Fast and longest rollercoasters

Cites Work

• How to draw a planar graph on a grid
• On embedding an outer-planar graph in a point set
• Orthogeodesic point-set embedding of trees
• Manhattan-Geodesic Embedding of Planar Graphs
• Optimal Algorithms to Embed Trees in a Point Set
• Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
• Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
• Unnamed Item

This page was built for publication: Improved Bounds for Drawing Trees on Fixed Points with L-Shaped Edges