A constrained optimization approach to finite element mesh smoothing
Finite Elements in Analysis and Design
Optismoothing: an optimization-driven approach to mesh smoothing
Finite Elements in Analysis and Design - Special issue—Robert J. Melosh medal competition
Mesh Smoothing Using A Posteriori Error Estimates
SIAM Journal on Numerical Analysis
Guaranteed-quality Delaunay meshing in 3D (short version)
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Algebraic Mesh Quality Metrics
SIAM Journal on Scientific Computing
Algebraic mesh quality metrics for unstructured initial meshes
Finite Elements in Analysis and Design
Guaranteed-quality parallel Delaunay refinement for restricted polyhedral domains
Computational Geometry: Theory and Applications - Special issue on the 18th annual symposium on computational geometrySoCG2002
An angle-based optimization approach for 2D finite element mesh smoothing
Finite Elements in Analysis and Design
Isosurface stuffing: fast tetrahedral meshes with good dihedral angles
ACM SIGGRAPH 2007 papers
High-fidelity geometric modeling for biomedical applications
Finite Elements in Analysis and Design
Technical Section: Quality encoding for tetrahedral mesh optimization
Computers and Graphics
Hexahedral mesh smoothing using a direct method
Computers & Geosciences
Hybrid mesh smoothing based on Riemannian metric non-conformity minimization
Finite Elements in Analysis and Design
Smoothing and local refinement techniques for improving tetrahedral mesh quality
Computers and Structures
New software developments for quality mesh generation and optimization from biomedical imaging data
Computer Methods and Programs in Biomedicine
Hi-index | 0.00 |
Despite its great success in improving the quality of a tetrahedral mesh, the original optimal Delaunay triangulation (ODT) is designed to move only inner vertices and thus cannot handle input meshes containing ''bad'' triangles on boundaries. In the current work, we present an integrated approach called boundary-optimized Delaunay triangulation (B-ODT) to smooth (improve) a tetrahedral mesh. In our method, both inner and boundary vertices are repositioned by analytically minimizing the L^1 error between a paraboloid function and its piecewise linear interpolation over the neighborhood of each vertex. In addition to the guaranteed volume-preserving property, the proposed algorithm can be readily adapted to preserve sharp features in the original mesh. A number of experiments are included to demonstrate the performance of our method.