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

Simplification of three-dimensional density maps.

Vijay Natarajan1, Herbert Edelsbrunner

  • 1Department of Computer Science, Duke University, Durham, NC 27708, USA. vijay@cs.duke.edu

IEEE Transactions on Visualization and Computer Graphics
|March 30, 2005
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

Maximum Betti Numbers of Čech Complexes.

Discrete & computational geometry·2026
Same author

Maximum persistent Betti numbers of Čech complexes.

Journal of applied and computational topology·2026
Same author

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

IEEE transactions on visualization and computer graphics·2026
Same author

On the Size of Chromatic Delaunay Mosaics.

Discrete & computational geometry·2026
Same author

Topological Analysis Reveals Multiple Pathways in Molecular Dynamics.

Journal of chemical theory and computation·2025
Same author

Tight Bounds Between the Jensen-Shannon Divergence and the Minmax Divergence.

Entropy (Basel, Switzerland)·2025
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

This study introduces a mesh simplification algorithm for large scientific datasets. The method improves data visualization and analysis by approximating functions, preserving topology, and enhancing mesh quality using an extended quadric error metric.

Area of Science:

  • Scientific visualization
  • Computational geometry
  • Data analysis

Background:

  • Scientific datasets describing density functions over 3D domains are often large.
  • Coarsened representations are necessary for efficient visualization and analysis.
  • Tetrahedral mesh representations are commonly used for such data.

Purpose of the Study:

  • To develop a mesh simplification algorithm for 3D density function datasets.
  • To balance function approximation, mesh topology preservation, and mesh quality improvement.
  • To evaluate the impact of mesh quality on density map approximation and topological feature preservation.

Main Methods:

  • A simplification algorithm for tetrahedral meshes was developed.
  • The algorithm incorporates an extended quadric error metric to improve mesh quality.

Related Experiment Videos

  • Computational experiments were conducted to assess the algorithm's performance.

    • Main Results:

    • The algorithm effectively approximates density functions while simplifying meshes.
    • Mesh quality improvement positively impacts density map approximation.
    • Geometric simplification's effect on topological features, including critical points, was analyzed.

    Conclusions:

    • The proposed algorithm offers a robust method for simplifying large scientific datasets.
    • Enhancing mesh quality is crucial for accurate density map approximation.
    • The study provides insights into the trade-offs between simplification, approximation, and topological feature preservation.