Abstract
In the visualization of the node-link graph, it is common to use edge-bundling algorithms to reduce the visual clutter caused by the increase in nodes and connections while reflecting the high-level structure of the graph. However, the traditional force-directed edge-bundling method has unstable gravitation when applied in three dimensions. To address this issue, we propose an edge-bundling algorithm based on the expectation model, and the edge-bundling rules can be modularized to support the addition of calculation rules. The stability of the proposed method is improved. Our experimental results with 2D and 3D scenarios demonstrate that our algorithm produces superior results that unclutter complex graphs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
