FORBID: Fast Overlap Removal By stochastic gradIent Descent for graph drawing

DOI10.1007/978-3-031-22203-0_6arXiv2208.10334OpenAlexW4297904617MaRDI QIDQ6117036

Romain Bourqui, Romain Giot, Frederic Lalanne, Loann Giovannangeli

Publication date: 16 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2208.10334

zbMATH Keywords

stochastic gradient descentlayout adjustmentstress optimizationoverlap removal

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• An algorithm for drawing general undirected graphs
• Deep neural network for drawing networks, \({(DNN)^{ 2 }} \)
• Node overlap removal algorithms: a comparative study
• A new algorithm for removing node overlapping in graph visualization
• A Sparse Stress Model
• Node Overlap Removal by Growing a Tree
• Efficient, Proximity-Preserving Node Overlap Removal
• Fast Node Overlap Removal—Correction
• An Experimental Study on Distance-Based Graph Drawing
• Probabilistic Principal Component Analysis
• Node Overlap Removal Algorithms: an Extended Comparative Study
• Graph Drawing
• Graph Drawing

This page was built for publication: FORBID: Fast Overlap Removal By stochastic gradIent Descent for graph drawing