Practical error-bounded remeshing by adaptive refinement
We propose an efficient and practically robust method to isotropically remesh an input
triangular mesh with bounded approximation error. Our method is based on a key
observation, that is, when more uniformly distributed vertices are added into the remeshed
mesh, the error-bounded constraint is usually satisfied. Then our algorithm adaptively
refines the remeshed mesh to satisfy the error-bounded constraint and avoid heavy
computational load. To that end, we present an iterative approach that alternates in each …
triangular mesh with bounded approximation error. Our method is based on a key
observation, that is, when more uniformly distributed vertices are added into the remeshed
mesh, the error-bounded constraint is usually satisfied. Then our algorithm adaptively
refines the remeshed mesh to satisfy the error-bounded constraint and avoid heavy
computational load. To that end, we present an iterative approach that alternates in each …
以上显示的是最相近的搜索结果。 查看全部搜索结果