Computing proximity drawings of trees in the 3-dimensional space

DOI10.1007/3-540-60220-8_66zbMath1502.68238OpenAlexW2102761211MaRDI QIDQ5057437

Giuseppe Di Battista, Giuseppe Liotta

Publication date: 16 December 2022

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

Full work available at URL: https://doi.org/10.1007/3-540-60220-8_66

Mathematics Subject Classification ID

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

Related Items (13)

3D straight-line grid drawing of 4-colorable graphs ⋮ Proximity drawings in polynomial area and volume ⋮ Computing proximity drawings of trees in the 3-dimensional space ⋮ The logic engine and the realization problem for nearest neighbor graphs ⋮ The strength of weak proximity ⋮ The rectangle of influence drawability problem ⋮ Drawing a tree as a minimum spanning tree approximation ⋮ Polynomial area bounds for MST embeddings of trees ⋮ Equilateral Spherical Drawings of Planar Cayley Graphs ⋮ The drawability problem for minimum weight triangulations ⋮ Polynomial Area Bounds for MST Embeddings of Trees ⋮ Advances in the theory and practice of graph drawing ⋮ Voronoi drawings of trees

Cites Work

• Unnamed Item
• Unnamed Item
• Algorithms for drawing graphs: An annotated bibliography
• Characterizing proximity trees
• The Problem of the Thirteen Spheres
• Computing proximity drawings of trees in the 3-dimensional space

This page was built for publication: Computing proximity drawings of trees in the 3-dimensional space