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

Random-accessible compressed triangle meshes.

Sung-Eui Yoon1, Peter Lindstrom

  • 1Korea Advanced Institute of Science and Technology. sungeui@cs.kaist.ac.kr

IEEE Transactions on Visualization and Computer Graphics
|October 31, 2007
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

Expanding Access to Science Participation: A FAIR Framework for Petascale Data Visualization and Analytics.

IEEE transactions on visualization and computer graphics·2025
Same author

A General Framework for Progressive Data Compression and Retrieval.

IEEE transactions on visualization and computer graphics·2023
Same author

Optical neural network via loose neuron array and functional learning.

Nature communications·2023
Same author

Progressive Tree-Based Compression of Large-Scale Particle Data.

IEEE transactions on visualization and computer graphics·2023
Same author

AMM: Adaptive Multilinear Meshes.

IEEE transactions on visualization and computer graphics·2022
Same author

Instant Panoramic Texture Mapping with Semantic Object Matching for Large-Scale Urban Scene Reproduction.

IEEE transactions on visualization and computer graphics·2021
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 new compression method for triangle meshes, enabling faster random access to large geometric data. The technique significantly reduces data transfer and improves performance without application code changes.

Area of Science:

  • Computer Graphics
  • Data Compression
  • Scientific Visualization

Background:

  • Exponential growth in geometric data necessitates efficient use of memory caches, storage, and bandwidth.
  • Existing methods focus on either sequential access compression or cache-coherent layouts for random access, presenting a conflict.
  • Combining compression with random access for large meshes is challenging due to differing data access assumptions.

Purpose of the Study:

  • To propose a novel order-preserving compression method for triangle meshes that supports transparent random access.
  • To enable efficient selective fetching, decoding, and caching of mesh data from disk.
  • To provide a general mesh access API for seamless traversal and incidence queries.

Main Methods:

  • Developed an order-preserving compression technique for triangle meshes.

Related Experiment Videos

  • Implemented a selective decompression mechanism for on-demand data retrieval and in-memory caching.
  • Designed a general mesh access API for mesh traversal and incidence queries.
  • Evaluated the method's suitability with cache-oblivious layouts.

    • Main Results:

    • Achieved compression rates of approximately 20:1.
    • Demonstrated significantly improved I/O performance due to reduced data transfer.
    • Observed 2-6 times overall speedup in benchmark applications using cache-oblivious layouts compared to uncompressed meshes.
    • Showcased performance improvements without requiring application code modifications.

    Conclusions:

    • The proposed compression method effectively supports transparent random access to compressed triangle meshes.
    • The technique minimizes I/O requests and enhances cache utilization, particularly with cache-oblivious layouts.
    • This approach offers a practical solution for handling large geometric datasets, improving performance and efficiency in visualization applications.