Topology-Driven Force-Directed Algorithms
From MaRDI portal
Publication:3073669
DOI10.1007/978-3-642-18469-7_15zbMath1314.68225OpenAlexW1815302832WikidataQ62042500 ScholiaQ62042500MaRDI QIDQ3073669
Walter Didimo, Salvatore A. Romeo, Giuseppe Liotta
Publication date: 11 February 2011
Published in: Graph Drawing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-18469-7_15
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (7)
Recognizing and drawing IC-planar graphs ⋮ On RAC drawings of 1-planar graphs ⋮ An improved force-directed graph layout algorithm based on aesthetic criteria ⋮ How to Draw a Planarization ⋮ A heuristic approach towards drawings of graphs with high crossing resolution ⋮ How to Draw a Planarization ⋮ Drawing graphs with right angle crossings
This page was built for publication: Topology-Driven Force-Directed Algorithms
