NDLI: Interactively Uncluttering Node Overlaps for Network Visualization

Content Provider	IEEE Xplore Digital Library
Author	Ishida, R. Takahashi, S. Hsiang-Yun Wu
Copyright Year	2015
Description	Author affiliation: Grad. Sch. of Frontier Sci., Univ. of Tokyo, Chiba, Japan (Ishida, R.) \|\| Dept. of Inf. & Comput. Sci., Keio Univ., Kanagawa, Japan (Hsiang-Yun Wu) \|\| Sch. of Comput. Sci. & Eng., Univ. of Aizu, Aizu-Wakamatsu, Japan (Takahashi, S.)
Abstract	Visual interaction with networks have been promising in the sense that we can successfully elucidate underlying relationships hidden behind complicated mutual relationships such as co-authorship networks, product co purchasing networks, and scale-free social networks. However, it is still burdensome to alleviate visual clutter arising from overlaps among node labels especially in such interactive environments as the networks become dense in terms of the topological connectivity. This paper presents a novel approach for dynamically rearranging the network layouts by incorporating centroidal Voronoi tessellation for better readability of node labels. Our idea is to smoothly transform the network layouts obtained through the conventional force-directed algorithm to that produced by the centroidal Voronoi tessellation to seek a plausible compromise between them. We also incorporated the Chebyshev distance metric into the centroidal Voronoi tessellation while adaptively adjusting the aspect ratios of the Voronoi cells so that we can place rectangular labels compactly over the network nodes. Finally, we applied the proposed approach to relatively large networks to demonstrate the feasibility of our formulation especially in interactive environments.
Starting Page	200
Ending Page	205
File Size	1706168
Page Count	6
File Format	PDF
ISSN	15506037
e-ISBN	9781467375689
DOI	10.1109/iV.2015.44
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2015-07-22
Publisher Place	Spain
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Layout Visualization Chebyshev approximation Springs Measurement Social network services Clutter interactive environments Centroidal Voronoi tessellation node labels Chebyshev distance
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Centroidal Voronoi Tessellation of Streamlines for Flow Visualization

Centroidal Voronoi Tessellation Based Algorithms for Vector Fields Visualization and Segmentation

Mesh clustering by approximating centroidal Voronoi tessellation

Centroidal voronoi tessellation based algorithms for vector fields visualization and segmentation (2004).

Centroidal Voronoi tessellation based algorithms for vector fields visualization and segmentation (2004)

Computing 2D Periodic Centroidal Voronoi Tessellation

Hyperbolic centroidal Voronoi tessellation

Centroidal Voronoi tessellation based algorithms for vector fields visualization and segmentation

Lp Centroidal Voronoi Tessellation and its Applications (2010)

Interactively Uncluttering Node Overlaps for Network Visualization

Similar Documents

Centroidal Voronoi Tessellation of Streamlines for Flow Visualization

Centroidal Voronoi Tessellation Based Algorithms for Vector Fields Visualization and Segmentation

Mesh clustering by approximating centroidal Voronoi tessellation

Centroidal voronoi tessellation based algorithms for vector fields visualization and segmentation (2004).

Centroidal Voronoi tessellation based algorithms for vector fields visualization and segmentation (2004)

Computing 2D Periodic Centroidal Voronoi Tessellation

Hyperbolic centroidal Voronoi tessellation

Centroidal Voronoi tessellation based algorithms for vector fields visualization and segmentation

Lp Centroidal Voronoi Tessellation and its Applications (2010)

Interactively Uncluttering Node Overlaps for Network Visualization