Robust and Efficient Preservation of High-Order Continuous Geometric Validity

We propose a novel method to robustly and efficiently compute the maximum allowable step sizes so that the 3D high-order finite elements continuously preserve geometric validity when moving along the given directions with positive step sizes smaller than the computed ones. We transform the problem of finding the maximum allowable step sizes to one of solving roots of cubic polynomials. To use interval arithmetic to avoid numerical issues in cubic equation solving, we completely enumerate the roots of cubic polynomials and apply the interval version of the Newton-Raphson iteration. The effectiveness of our algorithm is demonstrated through extensive testing. Compared to the state-of-the-art method, our algorithm achieves higher efficiency.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Visualization and Computer Graphics
Published
2025-08-26
DOI
https://doi.org/10.1109/tvcg.2025.3603025
Primary Topic
Advanced Numerical Analysis Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Robust and Efficient Preservation of High-Order Continuous Geometric Validity

Xiao‐Ming Fu, Jia‐Peng Guo, Wei Du, Shibo Liu et al.
IEEE Transactions on Visualization and Computer Graphics
Advanced Numerical Analysis Techniques
article

Robust and Efficient Preservation of High-Order Continuous Geometric Validity

Xiao‐Ming Fu, Jia‐Peng Guo, Wei Du, Shibo Liu, Ligang Liu
article en

Abstract

We propose a novel method to robustly and efficiently compute the maximum allowable step sizes so that the 3D high-order finite elements continuously preserve geometric validity when moving along the given directions with positive step sizes smaller than the computed ones. We transform the problem of finding the maximum allowable step sizes to one of solving roots of cubic polynomials. To use interval arithmetic to avoid numerical issues in cubic equation solving, we completely enumerate the roots of cubic polynomials and apply the interval version of the Newton-Raphson iteration. The effectiveness of our algorithm is demonstrated through extensive testing. Compared to the state-of-the-art method, our algorithm achieves higher efficiency.

IEEE Transactions on Visualization and Computer GraphicsVol. 31(12)
University of Science and Technology of China (CN)
Openalex Percentile: Top 76%
Advanced Numerical Analysis 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.