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...

Full description

Bibliographic Details

Published in:	IEEE transactions on visualization and computer graphics Vol. 30; no. 7; pp. 3386 - 3399
Main Authors:	Meidiana, Amyra, Hong, Seok-Hee, Cai, Shijun, Torkel, Marnijati, Eades, Peter
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.07.2024 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!