SubLinearForce: Fully Sublinear-Time Force Computation for Large Complex Graph Drawing

Recent works in graph visualization attempt to reduce the runtime of repulsion force computation of force-directed algorithms using sampling. However, they fail to reduce the runtime for attraction force computation to sublinear in the number of edges. We present the SubLinearForce framework for a f...

Celý popis

Podrobná bibliografie

Vydáno v:	IEEE transactions on visualization and computer graphics Ročník 30; číslo 7; s. 3386 - 3399
Hlavní autoři:	Meidiana, Amyra, Hong, Seok-Hee, Cai, Shijun, Torkel, Marnijati, Eades, Peter
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York IEEE 01.07.2024 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Algorithms Approximation algorithms Attraction Computation Force force-directed algorithms Graph drawing Measurement Resistance Run time (computers) Runtime Scalability Springs sublinear-time algorithms
ISSN:	1077-2626, 1941-0506
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!