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

Colors and Magnetism03:02

Colors and Magnetism

14.1K
Color in Coordination Complexes
When atoms or molecules absorb light at the proper frequency, their electrons are excited to higher-energy orbitals. For many main group atoms and molecules, the absorbed photons are in the ultraviolet range of the electromagnetic spectrum, which cannot be detected by the human eye. For coordination compounds, the energy difference between the d orbitals often allows photons in the visible range to be absorbed and emitted, which is seen as colors by the human...
14.1K
Ogive Graph01:07

Ogive Graph

6.8K
An ogive graph is sometimes called a cumulative frequency polygon. It is one type of frequency polygon that shows cumulative frequency. In other words, the cumulative percentages are added to the graph from left to right. An ogive graph plots cumulative frequency on the vertical y-axis and class boundaries along the horizontal x-axis. It’s very similar to a histogram; only instead of rectangles, an ogive displays a single point where the top right of the rectangle would be. Creating this...
6.8K
Graphing Antiderivatives01:30

Graphing Antiderivatives

76
The concept of an antiderivative is fundamental in calculus, describing how a function's values accumulate over time. This process is closely related to physical motion, such as the movement of a rolling ball. As the ball progresses, its position changes in response to variations in velocity, just as an antiderivative graph reflects the cumulative effect of the original function's values.Graphing an antiderivative requires interpreting how a function's values influence the shape of its...
76
Color Vision01:24

Color Vision

1.5K
Color perception begins in the retina, the light-sensitive layer at the back of the eye. Two main theories explain how colors are seen: the trichromatic theory and the opponent-process theory. The trichromatic theory, proposed by Thomas Young in 1802 and extended by Hermann von Helmholtz in 1852, suggests that color vision is based on three types of cone receptors in the retina. These cones are sensitive to different but overlapping ranges of wavelengths corresponding to red, blue, and green.
1.5K
Bar Graph01:07

Bar Graph

22.9K
A bar graph is also called a bar chart and consists of bars that are separated from each other. It either uses horizontal or vertical bars to show comparisons among categories. The bars can be rectangles, or they can be rectangular boxes (used in three-dimensional plots). One axis of the graph represents the specific categories being compared, and the other axis shows a discrete value. In this graph, the length of the bar for each category is proportional to the number or percent of individuals...
22.9K
Graphs of Functions01:30

Graphs of Functions

349
Graphs of functions provide a visual representation of how output values change in response to varying inputs. Each point on the graph corresponds to an ordered pair, where the x-coordinate (independent variable) determines the horizontal position and the y-coordinate (dependent variable) determines the vertical position. Linear functions like y = x give a straight line, indicating a constant rate of change.Nonlinear functions display more complex behaviors. Even power functions generate...
349

You might also read

Related Articles

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

Sort by
Same author

1-Methyl-3-trifluoro-methyl-5-[(3-chloro-phen-yl)sulfanyl]-1H-pyrazole-4-carbaldehyde O-(4-chloro-benzo-yl)oxime.

Acta crystallographica. Section E, Structure reports online·2011
Same author

1,3-Dimethyl-5-(3-methyl-phen-oxy)-1H-pyrazole-4-carbaldehyde.

Acta crystallographica. Section E, Structure reports online·2011
Same author

Prolonged hindlimb unloading leads to changes in electrophysiological properties of L5 dorsal root ganglion neurons in rats after 14 days.

Muscle & nerve·2011
Same author

Structural characterization of helitrons and their stepwise capturing of gene fragments in the maize genome.

BMC genomics·2011
Same author

[Study on manufacturing materials of imitation snails].

Zhongguo xue xi chong bing fang zhi za zhi = Chinese journal of schistosomiasis control·2011
Same author

Protein complex detection with semi-supervised learning in protein interaction networks.

Proteome science·2011
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: Feb 8, 2026

Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm
11:53

Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm

Published on: December 9, 2012

13.5K

A Coloring Algorithm for Disambiguating Graph and Map Drawings.

Yifan Hu, Lei Shi, Qingsong Liu

    IEEE Transactions on Visualization and Computer Graphics
    |July 12, 2018
    PubMed
    Summary
    This summary is machine-generated.

    This study introduces an algorithm for automatically assigning distinct colors to graph edges, improving clarity in complex drawings. This edge coloring method enhances readability by reducing visual confusion in non-planar graphs.

    More Related Videos

    Guide Wire Assisted Catheterization and Colored Dye Injection for Vascular Mapping of Monochorionic Twin Placentas
    09:04

    Guide Wire Assisted Catheterization and Colored Dye Injection for Vascular Mapping of Monochorionic Twin Placentas

    Published on: September 5, 2011

    15.4K
    Fabricating Metamaterials Using the Fiber Drawing Method
    11:57

    Fabricating Metamaterials Using the Fiber Drawing Method

    Published on: October 18, 2012

    14.3K

    Related Experiment Videos

    Last Updated: Feb 8, 2026

    Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm
    11:53

    Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm

    Published on: December 9, 2012

    13.5K
    Guide Wire Assisted Catheterization and Colored Dye Injection for Vascular Mapping of Monochorionic Twin Placentas
    09:04

    Guide Wire Assisted Catheterization and Colored Dye Injection for Vascular Mapping of Monochorionic Twin Placentas

    Published on: September 5, 2011

    15.4K
    Fabricating Metamaterials Using the Fiber Drawing Method
    11:57

    Fabricating Metamaterials Using the Fiber Drawing Method

    Published on: October 18, 2012

    14.3K

    Area of Science:

    • Computer Science
    • Graph Theory
    • Data Visualization

    Background:

    • Non-planar graphs inherently feature edge crossings.
    • Dense crossings at small angles impede edge following and slow eye movements.
    • Visual complexity in graph drawings reduces user comprehension.

    Purpose of the Study:

    • To develop an algorithm for automatic, distinctive edge coloring in graph drawings.
    • To disambiguate edges in complex, non-planar graphs.
    • To improve the readability and usability of graph visualizations.

    Main Methods:

    • Proposed an algorithm for near-optimal color assignment of a dual collision graph.
    • Utilized a novel branch-and-bound procedure.
    • Applied the procedure to a space decomposition of the color gamut.

    Main Results:

    • Demonstrated the approach with real-world graph and map examples.
    • Showcased automatic selection of distinctive colors for edge disambiguation.
    • Provided a user study evaluating effectiveness and limitations.

    Conclusions:

    • The proposed edge coloring algorithm effectively disambiguates graph edges.
    • Distinctive color assignment enhances the clarity of complex graph drawings.
    • The method shows promise for improving visualizations in various applications.