Three-dimensional constrained boundary recovery with an enhanced Steiner point suppression procedure

Authors:
Jianjun Chen;Dawei Zhao;Zhengge Huang;Yao Zheng;Shuming Gao
Affiliations:
Center for Engineering and Scientific Computation, Zhejiang University, Hangzhou 310027, China and School of Aeronautics and Astronautics, Zhejiang University, Hangzhou 310027, China;Center for Engineering and Scientific Computation, Zhejiang University, Hangzhou 310027, China and School of Aeronautics and Astronautics, Zhejiang University, Hangzhou 310027, China;Center for Engineering and Scientific Computation, Zhejiang University, Hangzhou 310027, China and School of Aeronautics and Astronautics, Zhejiang University, Hangzhou 310027, China;Center for Engineering and Scientific Computation, Zhejiang University, Hangzhou 310027, China and School of Aeronautics and Astronautics, Zhejiang University, Hangzhou 310027, China;State Key Lab. of CAD&CG, Zhejiang University, Hangzhou 310027, China
Venue:
Computers and Structures
Year:
2011

Citing 7
Cited 0

On the difficulty of triangulating three-dimensional nonconvex polyhedra.

Discrete & Computational Geometry
Automatic mesh generator with specified boundary

Computer Methods in Applied Mechanics and Engineering
General-Dimensional Constrained Delaunay and Constrained Regular Triangulations, I: Combinatorial Properties

Discrete & Computational Geometry
Boundary recovery for Delaunay tetrahedral meshes using local topological transformations

Finite Elements in Analysis and Design
Constrained Delaunay tetrahedral mesh generation and refinement

Finite Elements in Analysis and Design
Smoothing and local refinement techniques for improving tetrahedral mesh quality

Computers and Structures
Improving tetrahedral meshes

Improving tetrahedral meshes

Quantified Score

Hi-index	0.00

Visualization

Abstract

Boundary recovery is one of the primary obstacles in applying the Delaunay criterion to mesh generation. Minimization of the number of Steiner points is a common goal for three-dimensional boundary recovery. In this paper, this goal is achieved by using an enhanced Steiner point suppression procedure and introducing a small polyhedron reconnection operation. Combining the suppression procedure with Steiner point insertion and splitting, a complete three-dimensional constrained boundary recovery algorithm is presented, and its effectiveness is demonstrated in various numerical examples.