Computing proximity drawings of trees in the 3-dimensional space

DOI10.1007/3-540-60220-8_66zbMath1502.68238MaRDI 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

68R10: Graph theory (including graph drawing) in computer science

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

Related Items

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

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