Balanced Aspect Ratio Trees and Their Use for Drawing Large Graphs

DOI10.7155/JGAA.00024zbMATH Open0953.68109OpenAlexW2118292129MaRDI QIDQ4511264FDOQ4511264

Stephen G. Kobourov, Christian A. Duncan, 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

Mathematics Subject Classification ID

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

Cited In (1)

• A multi-dimensional approach to force-directed layouts of large graphs

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Balanced aspect ratio trees: Combining the advantages of \(k\)-\(d\) trees and octrees 👍 👎
• Planarity-preserving clustering and embedding for large planar graphs 👍 👎
• Graph Drawing 👍 👎

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)