Mesh Simplification Method Based on Fast Retrieval and Region-Preserving Quadric Error Metrics

This article explores an optimization method for lightweight 3D models by implementing mesh simplification through the Enhanced Quadratic Error Metric (QEM) algorithm. In response to the common problems of feature loss and geometric structure anomalies in the QEM algorithm, this study introduces surface density, vertex curvature, vertex distance, and boundary folding cost as simplification factors. These factors precisely control the folding cost of the edges, effectively preserving model features and maintaining the integrity of the geometric structure. In addition, the principle of KD tree is utilized to accelerate the search for effective point pairs, thereby reducing the complexity of the algorithm and improving processing efficiency. Experimental verification shows that the proposed improved QEM algorithm not only maintains high detail features, but also reduces the Hausdorff distance by at least $\mathbf{8 4. 9 5 \%}$ compared to the original QEM algorithm. Therefore, this algorithm provides a more efficient and reliable solution for lightweight 3D models.

Authors

Institutions

Publication Details

Published
2024-12-20
DOI
https://doi.org/10.1109/aiim64537.2024.10934569
Primary Topic
Image Retrieval and Classification Techniques
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Mesh Simplification Method Based on Fast Retrieval and Region-Preserving Quadric Error Metrics

Huibin Yan, Hao Tan, Chunjiang Wu, Haoyu Lu
Image Retrieval and Classification Techniques
article

Mesh Simplification Method Based on Fast Retrieval and Region-Preserving Quadric Error Metrics

Huibin Yan, Hao Tan, Chunjiang Wu, Haoyu Lu
article en

Abstract

This article explores an optimization method for lightweight 3D models by implementing mesh simplification through the Enhanced Quadratic Error Metric (QEM) algorithm. In response to the common problems of feature loss and geometric structure anomalies in the QEM algorithm, this study introduces surface density, vertex curvature, vertex distance, and boundary folding cost as simplification factors. These factors precisely control the folding cost of the edges, effectively preserving model features and maintaining the integrity of the geometric structure. In addition, the principle of KD tree is utilized to accelerate the search for effective point pairs, thereby reducing the complexity of the algorithm and improving processing efficiency. Experimental verification shows that the proposed improved QEM algorithm not only maintains high detail features, but also reduces the Hausdorff distance by at least $\mathbf{8 4. 9 5 \%}$ compared to the original QEM algorithm. Therefore, this algorithm provides a more efficient and reliable solution for lightweight 3D models.

University of Electronic Science and Technology of China (CN), Chengdu University of Information Technology (CN)
University of Electronic Science and Technology of China
Openalex Percentile: Top 71%
Image Retrieval and Classification Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.