Wang, Isotropic remeshing with fast and exact computation of restricted Voronoi diagram, Comput. Desbrun, Interleaving Delaunay refinement and optimization for practical isotropic tetrahedron mesh generation, ACM Trans. Alliez, Perturbing slivers in 3D delaunay meshes, in Proceedings of the 18th International Meshing Roundtable, 2009, pp.
#DMESH TRIANGULATION GENERATOR#
Si, TetGen: A Quality Tetrahedral Mesh Generator and Three-Dimensional Delaunay Triangulator, (2007). Schenk, eds., CRC Press, Boca Raton, FL, 2011, pp. Shewchuk, Unstructured mesh generation, in Combinatorial Scientific Computing, U. Shewchuk, General-dimensional constrained delaunay and constrained regular triangulations I: Combinatorial properties, Discrete Comput. Shewchuk, What is a good linear element? Interpolation, conditioning, and quality measures, in Proceedings of the 11th International Meshing Roundtable, 2002, pp. Schöberl, Netgen-an advancing front 2d/3d-mesh generator based on abstract rules, Comput.
Morgan, Automatic generation of unstructured meshes for Navier Stokes flows, in Proceedings of AIAA, Albuquerque, NM, 1998, pp. Wright, Numerical Optimization, 2 nd ed., Springer, New York, 2006. Löhner, A parallel advancing front grid generation scheme, Internat. Yang, On centroidal Voronoi tessellation-energy smoothness and fast computation, ACM Trans. Part II-a framework for volume mesh optimization and the condition number of the Jacobian matrix, Internat. Knupp, Achieving finite element mesh quality via optimization of the Jacobian matrix norm and associated quantities. thesis, EECS Department, University of California, Berkeley, 2008. Klingner, Improving Tetrahedral Meshes, Ph.D. Vecchi, Optimization by simulated annealing, Science, 220 ( 1983 ), pp. Möller, Invariant integration formulas for the $n$-simplex by combinatorial methods, SIAM J. Remacle : A 3-d finite element mesh generator with built-in pre- and post-processing facilities, Internat. Gersho, Asymptotically optimal block quantization, IEEE Trans. George, tetrahedral mesh generator, in INRIA User's Manual, INRIA, Paris, 2004. Cools, An adaptive numerical cubature algorithm for simplices, ACM Trans. George, Mesh Generation: Application to Finite Elements, Wiley, London, 2000. , A comparison of tetrahedral mesh improvement techniques, in Proceedings of the 5th International Meshing Roundtable, 1996, pp. Knupp, Tetrahedral element shape optimization via the Jacobian determinant and condition number, in Proceedings of the 8th International Meshing Roundtable, 1999, pp. Flanders, Differentiation under the integral sign, Amer. Wang, Anisotropic centroidal Voronoi tessellations and their applications, SIAM J. Wang, Tetrahedral mesh generation and optimization based on centroidal Voronoi tessellations, Internat.
Gunzburger, Centroidal Voronoi tessellations: Applications and algorithms, SIAM Rev. Shontz, A comparison of two optimization methods for mesh quality improvement, Eng. Xu, Optimal anisotropic meshes for minimizing interpolation errors in $L^p$ norm, Math. Holst, Efficient mesh optimization schemes based on optimal Delaunay triangulations, Comput.
Chen, Mesh smoothing schemes based on optimal delaunay triangulations, in Proceedings of the 13th International Meshing Roundtable, 2004, pp. Desbrun, Variational tetrahedral meshing, ACM Trans. Experimental results are evaluated and compared using standard metrics.ġ. First, the local search has a faster speed of convergence than previous work due to the better behavior of the objective function, and second, the algorithm avoids getting stuck in a poor local minimum. This results from the combination of two effects. The benefits of the method are both improved performances and an improved quality of the result in terms of dihedral angles. To optimize the objective function, this paper proposes a hybrid algorithm that combines a local search (quasi-Newton) with a global optimization (simulated annealing). This continuous/analytic point of view leads to an objective function that is continuous and Delaunay consistent, in contrast with the discrete/geometrical point of view developed in previous work. It revisits the class of methods based on optimal Delaunay triangulation (ODT) and proposes a proper way of injecting a background density function into the objective function minimized by ODT. This paper proposes a new algorithm to generate a graded three-dimensional tetrahedral mesh.
0 kommentar(er)
