Topology-driven force-directed algorithms
DOI10.1007/978-3-642-18469-7_15zbMATH Open1314.68225DBLPconf/gd/DidimoLR10OpenAlexW1815302832WikidataQ62042500 ScholiaQ62042500MaRDI QIDQ3073669FDOQ3073669
Authors: Walter Didimo, Giuseppe Liotta, Salvatore A. Romeo 
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
Recommendations
- A force-directed algorithm that preserves edge-crossing properties
- scientific article; zbMATH DE number 1858605
- A heuristic approach towards drawings of graphs with high crossing resolution
- scientific article; zbMATH DE number 1424309
- An improved force-directed graph layout algorithm based on aesthetic criteria
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)
Cited In (7)
- A force-directed algorithm that preserves edge-crossing properties
- One-dimensional layout optimization, with applications to graph drawing by axis separation
- A heuristic approach towards drawings of graphs with high crossing resolution
- Drawing graphs with right angle crossings
- How to draw a planarization
- How to draw a planarization
- An improved force-directed graph layout algorithm based on aesthetic criteria
This page was built for publication: Topology-driven force-directed algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3073669)
