Three-Dimensional Drawings of Bounded Degree Trees

DOI10.1007/978-3-540-70904-6_10MaRDI QIDQ3595469zbMATH OpenOpenAlexFDO

Authors Fabrizio Frati, Giuseppe Di Battista

Publication date 28 August 2007

Published in Graph Drawing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70904-6_10

Mathematics Subject Classification ID

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

Recommendations

• Computing proximity drawings of trees in the 3-dimensional space
• Minimum-area drawings of plane 3-trees
• Degree bounded bottleneck spanning trees in three dimensions
• 3-trees in polyhedral maps
• Universal line-sets for drawing planar 3-trees
• Universal line-sets for drawing planar 3-trees
• Drawing planar 3-trees with given face-areas
• Proximity drawings of high-degree trees
• scientific article; zbMATH DE number 2084286
• Minimum-layer drawings of trees (extended abstract)

Cited in

(3)

• Drawing planar 3-trees with given face areas
• A k-Tree Generalization that Characterizes Consistency of Dimensioned Engineering Drawings
• Computing proximity drawings of trees in the 3-dimensional space

This page was built for publication: Three-Dimensional Drawings of Bounded Degree Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3595469)