Pinning Balloons with Perfect Angles and Optimal Area

DOI10.1007/978-3-642-25878-7_16zbMath1311.68169arXiv1109.1705OpenAlexW2103420490MaRDI QIDQ3223951

André Schulz, Immanuel Halupczok

Publication date: 9 March 2012

Published in: Graph Drawing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (1)

Drawing trees with perfect angular resolution and polynomial area

Cites Work

• Unnamed Item
• Complexity analysis of balloon drawing for rooted trees
• A note on optimal area algorithms for upward drawings of binary trees
• Time bounds for selection
• Drawing Trees with Perfect Angular Resolution and Polynomial Area
• Tree Drawings on the Hexagonal Grid
• On the Angular Resolution of Planar Graphs
• On Balloon Drawings of Rooted Trees
• Straight-Line Orthogonal Drawings of Binary and Ternary Trees
• DRAWING WITH FAT EDGES
• Algorithms and Data Structures

This page was built for publication: Pinning Balloons with Perfect Angles and Optimal Area