Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Online dynamic graph drawing.

Yaniv Frishman1, Ayellet Tal

  • 1Department of Computer Science, Technion, Israel Institute of Technology, Haifa, Israel. frishman@tx.technion.ac.il

IEEE Transactions on Visualization and Computer Graphics
|May 10, 2008
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

The role of Smarcad1 in retroviral repression in mouse embryonic stem cells.

Mobile DNA·2024
Same author

Differential effect of histone H3.3 depletion on retroviral repression in embryonic stem cells.

Clinical epigenetics·2023
Same author

Trim24 and Trim33 Play a Role in Epigenetic Silencing of Retroviruses in Embryonic Stem Cells.

Viruses·2020
Same author

Surface Regions of Interest for Viewpoint Selection.

IEEE transactions on pattern analysis and machine intelligence·2016
Same author

Context-aware saliency detection.

IEEE transactions on pattern analysis and machine intelligence·2011
Same author

Animation of flocks flying in line formations.

Artificial life·2011
Same journal

Blue Noise Dithering for Reservoir-based Spatio-temporal Importance Resampling.

IEEE transactions on visualization and computer graphics·2026
Same journal

ROS-GS: Relightable Outdoor Scenes With Gaussian Splatting.

IEEE transactions on visualization and computer graphics·2026
Same journal

MesoSplats: Texture Synthesis with Gaussian Splatting.

IEEE transactions on visualization and computer graphics·2026
Same journal

GLLA: A Unified Force-Directed Graph Layout Framework Supporting Local Adjustments.

IEEE transactions on visualization and computer graphics·2026
Same journal

Multi-Perception Crowd: Learning to combine entity and implicit perception for diverse crowd simulation.

IEEE transactions on visualization and computer graphics·2026
Same journal

Hiding in Plain Sight: Camouflaging Real-world Objects.

IEEE transactions on visualization and computer graphics·2026
See all related articles

This study introduces an online graph drawing algorithm that preserves the user's mental map during dynamic graph changes. It leverages GPU acceleration for significant speedups in visualizing large, evolving networks.

Area of Science:

  • Computer Science
  • Graph Theory
  • Data Visualization

Background:

  • Maintaining user's mental map is crucial for understanding dynamic graph structures.
  • Existing algorithms struggle with large, frequently changing graphs.
  • Online graph drawing requires efficient layout generation for sequential graph states.

Purpose of the Study:

  • To develop an online graph drawing algorithm that preserves global graph structure.
  • To reduce layout computation time for large dynamic graphs.
  • To demonstrate the algorithm's efficiency and scalability using GPU techniques.

Main Methods:

  • An online algorithm that allows arbitrary graph modifications between layouts.
  • Implementation of execution culling methods to optimize layout time.

Related Experiment Videos

  • Utilizing GPU (Graphics Processing Unit) for graph representation and computation.
  • Benchmarking against CPU (Central Processing Unit) implementations.

    • Main Results:

    • The algorithm successfully maintains the global structure and user's mental map.
    • Significant speedups (up to 17x) achieved using GPU compared to CPU.
    • Demonstrated scalability across different GPU generations.
    • Effective handling of large dynamic graphs with reduced layout time.

    Conclusions:

    • The proposed online algorithm is efficient for dynamic graph visualization.
    • GPU acceleration is key to achieving high performance for large-scale graph layouts.
    • The algorithm is applicable to real-world scenarios like social network and discussion thread visualization.