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

Fast Decoupled and DC Powerflow01:24

Fast Decoupled and DC Powerflow

The fast decoupled power flow method addresses contingencies in power system operations, such as generator outages or transmission line failures. This method provides quick power flow solutions, essential for real-time system adjustments. Fast decoupled power flow algorithms simplify the Jacobian matrix by neglecting certain elements, leading to two sets of decoupled equations:
Uniform Depth Channel Flow: Problem Solving01:18

Uniform Depth Channel Flow: Problem Solving

To calculate the flow rate for a trapezoidal channel, first, identify the bottom width, side slope, and flow depth of the channel. The cross-sectional area (A) corresponding to the depth of flow (y), channel bottom width (B), and side slope (θ) is determined by:Next, calculate the wetted perimeter, which includes the bottom width and the sloped side lengths in contact with the water. Using the values of the cross-sectional area and the wetted perimeter, determine the hydraulic radius by...
Flow Cytometry01:23

Flow Cytometry

The development of flow cytometry techniques began in 1934 with initial attempts by Andrew Moldavan, a bacteriologist who counted the cells in a flowing capillary system. Moldavan pumped cells through a capillary tube focused under a microscope for visualization. The invention of photometry allowed the measurement of differentially-stained cells, and Louis Kamentsky developed the first multiparameter flow cytometer in 1965 to identify and count the cancer cells in cervical tissue specimens.
In...
Uniform Depth Channel Flow01:27

Uniform Depth Channel Flow

Uniform depth channel flow keeps fluid depth consistent along channels such as irrigation canals. In natural channels, such as rivers, approximate uniform flow is often assumed. This condition occurs when the channel’s bottom slope matches the energy slope, balancing potential energy lost from gravity with head loss due to shear stress. This balance prevents depth changes along the channel length, resulting in a steady, uniform flow.Uniform flow in open channels with a constant cross-section...
Extraction: Partition and Distribution Coefficients01:14

Extraction: Partition and Distribution Coefficients

The distribution law or Nernst's distribution law is the law that governs the distribution of a solute between two immiscible solvents. This law, also known as the partition law, states that if a solute is added to the mixture of two immiscible solvents at a constant temperature, the solute is distributed between the two solvents in such a way that the ratio of solute concentrations in the solvents remains constant at equilibrium.
For extracting a solute from an aqueous phase into an organic...
Area Computation by the Alternative Coordinate Method01:24

Area Computation by the Alternative Coordinate Method

The alternative coordinate method, also known as the Shoelace Formula, is a technique for determining the area of a traverse using Cartesian coordinates. This method relies on the sequential arrangement of x and y coordinates for each point of the shape, ensuring accuracy and ease of application.In this approach, each corner's x and y coordinates are listed as fractions, with the x-coordinate as the numerator and the y-coordinate as the denominator. These coordinates are arranged sequentially...

You might also read

Related Articles

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

Sort by
Same author

Explorative Analysis of Dynamic Force Networks in 2D Photoelastic Disks Ensembles.

IEEE transactions on visualization and computer graphics·2026
Same author

Continuous Scatterplot and Image Moments for Time-Varying Bivariate Field Analysis of Electronic Structure Evolution.

IEEE transactions on visualization and computer graphics·2025
Same author

Multi-Field Visualization: Trait Design and Trait-Induced Merge Trees.

IEEE transactions on visualization and computer graphics·2025
Same author

A unified framework for prediction of liver steatosis dynamics in response to different diet and drug interventions.

Clinical nutrition (Edinburgh, Scotland)·2024
Same author

VIAMD: a Software for Visual Interactive Analysis of Molecular Dynamics.

Journal of chemical information and modeling·2023
Same author

Continuous Scatterplot Operators for Bivariate Analysis and Study of Electronic Transitions.

IEEE transactions on visualization and computer graphics·2023
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

Related Experiment Video

Updated: May 28, 2026

Determining 3D Flow Fields via Multi-camera Light Field Imaging
14:25

Determining 3D Flow Fields via Multi-camera Light Field Imaging

Published on: March 6, 2013

Efficient Computation of Combinatorial Feature Flow Fields.

Jan Reininghaus, Jens Kasten, Tino Weinkauf

    IEEE Transactions on Visualization and Computer Graphics
    |October 26, 2011
    PubMed
    Summary
    This summary is machine-generated.

    We introduce a novel combinatorial algorithm for tracking critical points in 2D time-dependent scalar fields. This noise-robust method avoids derivatives and offers a time-aware feature hierarchy for analyzing large datasets.

    More Related Videos

    Visualization and Quantification of High-Dimensional Cytometry Data using Cytofast and the Upstream Clustering Methods FlowSOM and Cytosplore
    06:01

    Visualization and Quantification of High-Dimensional Cytometry Data using Cytofast and the Upstream Clustering Methods FlowSOM and Cytosplore

    Published on: December 12, 2019

    Related Experiment Videos

    Last Updated: May 28, 2026

    Determining 3D Flow Fields via Multi-camera Light Field Imaging
    14:25

    Determining 3D Flow Fields via Multi-camera Light Field Imaging

    Published on: March 6, 2013

    Visualization and Quantification of High-Dimensional Cytometry Data using Cytofast and the Upstream Clustering Methods FlowSOM and Cytosplore
    06:01

    Visualization and Quantification of High-Dimensional Cytometry Data using Cytofast and the Upstream Clustering Methods FlowSOM and Cytosplore

    Published on: December 12, 2019

    Area of Science:

    • Data Analysis
    • Computational Science
    • Scientific Visualization

    Background:

    • Tracking critical points in time-dependent scalar fields is crucial for scientific analysis.
    • Existing methods often rely on derivatives, making them sensitive to noise and computationally intensive.
    • A need exists for robust, parameter-efficient algorithms for analyzing large-scale time-varying data.

    Purpose of the Study:

    • To develop a novel combinatorial algorithm for tracking critical points in 2D time-dependent scalar fields.
    • To create a noise-robust and computationally efficient alternative to existing tracking methods.
    • To introduce a time-aware feature hierarchy for prioritizing significant features.

    Main Methods:

    • A combinatorial approach is employed, avoiding derivatives, interpolation, and numerical integration.
    • A new importance measure combines spatial persistence and temporal evolution of critical points.
    • The algorithm is designed for out-of-core processing to handle large datasets.

    Main Results:

    • The proposed method demonstrates robustness against noise.
    • A single, easy-to-tune parameter simplifies usage.
    • The time-aware feature hierarchy effectively distinguishes important features from spurious ones.
    • The algorithm was successfully applied to synthetic and computational fluid dynamics data.

    Conclusions:

    • The combinatorial algorithm provides a robust and efficient solution for tracking critical points in time-dependent scalar fields.
    • The method's out-of-core formulation enables the analysis of large datasets.
    • The time-aware feature hierarchy enhances the interpretability of complex scientific data.