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 Concept Videos

Survival Tree01:19

Survival Tree

125
Survival trees are a non-parametric method used in survival analysis to model the relationship between a set of covariates and the time until an event of interest occurs, often referred to as the "time-to-event" or "survival time." This method is particularly useful when dealing with censored data, where the event has not occurred for some individuals by the end of the study period, or when the exact time of the event is unknown.
 Building a Survival Tree
Constructing a...
125
Phylogenetic Trees03:21

Phylogenetic Trees

45.7K
Phylogenetic trees come in many forms. It matters in which sequence the organisms are arranged from the bottom to the top of the tree, but the branches can rotate at their nodes without altering the information. The lines connecting individual nodes can be straight, angled, or even curved.
45.7K
Adjusting a Traverse01:12

Adjusting a Traverse

86
In the site survey of a four-sided traverse, internal angles are essential to ensure geometric accuracy. The survey revealed that the sum of the measured internal angles was 359 degrees and 48 minutes, which is 12 minutes less than the expected 360 degrees. This discrepancy signals an error likely arising from measurement inaccuracies during the fieldwork.To rectify this error, the adjustment process involved distributing the 12-minute shortfall equally across the four internal angles. By...
86
Design Example: Traverse Angle Computations01:25

Design Example: Traverse Angle Computations

114
Traverse angle computations are a critical component of surveying, used to compute the internal angles within a closed traverse. A traverse consists of a series of connected lines forming a closed loop, often used for land boundary delineation or mapping. Calculating the internal angles ensures accuracy in the traverse geometry and is essential for checking survey data integrity.The process begins with known azimuths and bearings of the traverse sides. Internal angles at each vertex are...
114
Design Example: Maintaining Level of an Embankment01:19

Design Example: Maintaining Level of an Embankment

98
Constructing a roadway embankment over uneven terrain requires precise leveling to ensure stability and proper drainage. Surveyors use a leveling instrument and staff to calculate ground elevations and determine the required fill material at each point along the embankment alignment.The process begins by positioning a leveling instrument near a benchmark with a known elevation. A backsight reading establishes the instrument height, which serves as a reference for subsequent measurements. A...
98
Evolutionary Relationships through Genome Comparisons02:54

Evolutionary Relationships through Genome Comparisons

5.9K
Genome comparison is one of the excellent ways to interpret the evolutionary relationships between organisms. The basic principle of genome comparison is that if two species share a common feature, it is likely encoded by the DNA sequence conserved between both species. The advent of genome sequencing technologies in the late 20th century enabled scientists to understand the concept of conservation of domains between species and helped them to deduce evolutionary relationships across diverse...
5.9K

You might also read

Related Articles

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

Sort by
Same author

Langevin and Fokker-Planck analyses for diffusion-mediated passing of circular and discorectangular species in two-dimensional channels.

Physical review. E·2026
Same author

Practical Catalytic Asymmetric Synthesis of Gem-Dimethyl Bicyclic [3.1.0] Proline: A Valuable Building Block for Antiviral Agents.

The Journal of organic chemistry·2026
Same author

The prognostic value of different HPV infection statuses in cervical cancer.

Scientific reports·2026
Same author

Optimizing Performance and Satisfaction in Matching and Movement Tasks in Virtual Reality with Interventions Using the Data Visualization Literacy Framework.

Frontiers in virtual reality·2026
Same author

Integrating dynamic vegetation phenology into SWAT improves watershed nitrogen and phosphorus simulations.

Journal of environmental management·2026
Same author

Distribution of divalent small interfering RNA into neurons of sensory ganglia produces selective, durable knockdown of Nav1.7 and strong analgesia.

Pain·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
Same journal

RTF2Mesh: Restricted Tangent Face Based Mesh Compression With Neural Displacement Fields.

IEEE transactions on visualization and computer graphics·2026
Same journal

Practical Occluder Generation for Mobile Games.

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

Related Experiment Video

Updated: Jul 31, 2025

A Practical Guide to Phylogenetics for Nonexperts
12:00

A Practical Guide to Phylogenetics for Nonexperts

Published on: February 5, 2014

35.4K

A Scalable Method for Readable Tree Layouts.

Kathryn Gray, Mingwei Li, Reyan Ahmed

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

    This study introduces a new scalable tree layout algorithm that prevents label overlap and edge crossings. It optimizes for edge length preservation or compactness, improving visualization of large datasets.

    More Related Videos

    Author Spotlight: Advancements in X-ray CT Tool Chain for Tree Core Analysis
    06:56

    Author Spotlight: Advancements in X-ray CT Tool Chain for Tree Core Analysis

    Published on: September 22, 2023

    1.1K
    Scalable, Flexible, and Cost-Effective Seedling Grafting
    09:33

    Scalable, Flexible, and Cost-Effective Seedling Grafting

    Published on: January 6, 2023

    1.9K

    Related Experiment Videos

    Last Updated: Jul 31, 2025

    A Practical Guide to Phylogenetics for Nonexperts
    12:00

    A Practical Guide to Phylogenetics for Nonexperts

    Published on: February 5, 2014

    35.4K
    Author Spotlight: Advancements in X-ray CT Tool Chain for Tree Core Analysis
    06:56

    Author Spotlight: Advancements in X-ray CT Tool Chain for Tree Core Analysis

    Published on: September 22, 2023

    1.1K
    Scalable, Flexible, and Cost-Effective Seedling Grafting
    09:33

    Scalable, Flexible, and Cost-Effective Seedling Grafting

    Published on: January 6, 2023

    1.9K

    Area of Science:

    • Computer Science
    • Data Visualization
    • Graph Theory

    Background:

    • Real-world relational datasets often involve large tree structures with node and edge attributes.
    • Existing tree layout algorithms struggle to balance readability requirements like non-overlapping labels, non-crossing edges, preserved edge lengths, and compactness.
    • Scalable and readable tree visualizations are crucial for communicating complex data.

    Purpose of the Study:

    • To propose a novel, scalable algorithm for generating readable tree layouts.
    • To address limitations of existing methods by considering node labels and edge lengths.
    • To optimize for either edge length preservation or layout compactness while ensuring no label overlaps or edge crossings.

    Main Methods:

    • Developed a new tree layout algorithm focusing on scalability and readability.
    • The algorithm guarantees no edge crossings and no label overlaps.
    • It offers optimization for either desired edge lengths or compactness.

    Main Results:

    • The new algorithm demonstrates superior performance compared to existing approaches on large real-world datasets (thousands to hundreds of thousands of nodes).
    • It successfully generates layouts with no edge crossings and no label overlaps.
    • The algorithm effectively optimizes for either edge length preservation or compactness.

    Conclusions:

    • The proposed algorithm offers a significant advancement in scalable and readable tree layout generation.
    • It provides a practical solution for visualizing complex, large-scale relational data.
    • The method can be extended to visualize large general graphs through hierarchical tree extraction, enabling map-like visualizations.