[图书][B] Delaunay mesh generation

SW Cheng, TK Dey, J Shewchuk, S Sahni - 2013 - api.taylorfrancis.com
The study of algorithms for generating unstructured meshes of triangles and tetrahedra
began with mechanical and aeronautical engineers who decompose physical domains into …

[PDF][PDF] A quality tetrahedral mesh generator and three-dimensional delaunay triangulator

H Si, A TetGen - Weierstrass Institute for Applied Analysis and …, 2006 - stuff.mit.edu
TetGen Page 1 TetGen A Quality Tetrahedral Mesh Generator and Three-Dimensional Delaunay
Triangulator Version 1.4 User’s Manual January 18, 2006 Hang Si si@wias-berlin.de …

A survey of algorithms for geodesic paths and distances

K Crane, M Livesu, E Puppo, Y Qin - arXiv preprint arXiv:2007.10430, 2020 - arxiv.org
Numerical computation of shortest paths or geodesics on curved domains, as well as the
associated geodesic distance, arises in a broad range of applications across digital …

Modeling of ground excavation with the particle finite-element method

JM Carbonell, E Oñate, B Suárez - Journal of engineering …, 2010 - ascelibrary.org
An excavation process is a nonlinear dynamic problem that includes geometrical, material,
and contact nonlinearities. The simulation of ground excavation has to face contact …

A generic software design for Delaunay refinement meshing

L Rineau, M Yvinec - Computational Geometry, 2007 - Elsevier
This paper describes a generic software designed to implement meshing algorithms based
on the Delaunay refinement paradigm. Such a meshing algorithm is generally described …

On refinement of constrained Delaunay tetrahedralizations

H Si - Proceedings of the 15th international meshing …, 2006 - Springer
This paper discusses the problem of refining constrained Delaunay tetrahedralizations
(CDTs) into good quality meshes suitable for adaptive numerical simulations. A practical …

Perturbing slivers in 3D Delaunay meshes

J Tournois, R Srinivasan, P Alliez - Proceedings of the 18th international …, 2009 - Springer
Isotropic tetrahedron meshes generated by Delaunay refinement algorithms are known to
contain a majority of well-shaped tetrahedra, as well as spurious sliver tetrahedra. As the …

Three-dimensional Delaunay refinement for multi-core processors

AN Chernikov, NP Chrisochoides - Proceedings of the 22nd annual …, 2008 - dl.acm.org
We develop the first ever fully functional three-dimensional guaranteed quality parallel
graded Delaunay mesh generator. First, we prove a criterion and a sufficient condition of …

Meshing 3D domains bounded by piecewise smooth surfaces

L Rineau, M Yvinec - Proceedings of the 16th International Meshing …, 2007 - Springer
This paper proposes an algorithm to mesh 3D domains bounded by piecewise smooth
surfaces. The algorithm may handle multivolume domains defined by non connected or non …

[PDF][PDF] Delaunay mesh generation of three dimensional domains

TK Dey - Tessellations in the sciences: virtues, techniques and …, 2007 - Citeseer
Delaunay meshes are used in various applications such as finite element analysis,
computer graphics rendering, geometric modeling, and shape analysis. As the applications …