Balanced Aspect Ratio Trees and Their Use for Drawing Large Graphs

DOI10.7155/JGAA.00024MaRDI QIDQ4511264zbMATH OpenOpenAlexFDO

Authors Christian A. Duncan, Stephen G. Kobourov, Michael T. Goodrich

Publication date 3 January 2001

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/48610, http://www.emis.de/journals/JGAA/accepted/00/Duncan%2B00.4.3.pdf

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Planarity-preserving clustering and embedding for large planar graphs
• scientific article; zbMATH DE number 1500683
• Graph Drawing
• Balanced aspect ratio trees: Combining the advantages of k-d trees and octrees
• scientific article; zbMATH DE number 1305419

Cited in

(3)

• A multi-dimensional approach to force-directed layouts of large graphs
• Treemaps with bounded aspect ratio
• Algorithms and Data Structures

This page was built for publication: Balanced Aspect Ratio Trees and Their Use for Drawing Large Graphs

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