Academia.eduAcademia.edu

Outline

Title
Abstract
Introduction
Unstructured Mesh Generation Methodology
Conclusions and Future Work
References
All Topics
Mathematics
Applied Mathematics

Recent progress in robust and quality Delaunay mesh generation

Profile image of Desheng WangDesheng Wang

2006, Journal of Computational and Applied Mathematics

https://doi.org/10.1016/J.CAM.2005.07.014
visibility

…

description

16 pages

link

1 file

Abstract

In this paper, some current issues of Delaunay mesh generation and optimization are addressed, with particular emphasis on the robustness of the meshing procedure and the quality of the resulting mesh. We also report new progress on the robust conforming and constrained boundary recovery in three dimensions, along with the quality mesh generation based on Centroidal Voronoi tessellations. Applications to the numerical solution of differential equations and integrations with other softwares are discussed, including a brief discussion on the joint mesh and solver adaptation strategy.

Related papers

Constrained CVT meshes and a comparison of triangular mesh generators
Hoa Nguyen

Computational Geometry, 2009

Mesh generation in regions in Euclidean space is a central task in computational science, and especially for commonly used numerical methods for the solution of partial differential equations, e.g., finite element and finite volume methods. We focus on the uniform Delaunay triangulation of planar regions and, in particular, on how one selects the positions of the vertices of the triangulation. We discuss a recently developed method, based on the centroidal Voronoi tessellation (CVT) concept, for effecting such triangulations and present two algorithms, including one new one, for CVT-based grid generation. We also compare several methods, including CVT-based methods, for triangulating planar domains. To this end, we define several quantitative measures of the quality of uniform grids. We then generate triangulations of several planar regions, including some having complexities that are representative of what one may encounter in practice. We subject the resulting grids to visual and quantitative comparisons and conclude that all the methods considered produce high-quality uniform grids and that the CVT-based grids are at least as good as any of the others.

View PDFchevron_right
Polyhedral mesh generation and optimization for non-manifold domains
Rao Garimella, Markus Berndt

We present a preliminary method to generate polyhedral meshes of general non-manifold domains. The method is based on computing the dual of a general tetrahedral mesh. The resulting mesh respects the topology of the domain to the same extent as the input mesh. If the input tetrahedral mesh is Delaunay and well-centered, the resulting mesh is a Voronoi mesh with planar faces. For general tetrahedral meshes, the resulting mesh is a polyhedral mesh with straight edges but possibly curved faces. The initial mesh generation phase is followed by a mesh untangling and quality improvement technique. We demonstrate the technique on some simple to moderately complex domains.

View PDFchevron_right
Delaunay mesh construction
Ramsay Dyer

Symposium on Geometry Processing, 2007

We present algorithms to produce Delaunay meshes from arbitrary triangle meshes by edge flipping and geometry- preserving refinement and prove their correctness. In particular we show that edge flipping serves to reduce mesh surface area, and that a poorly sampled input mesh may yield unflippable edges necessitating refinement to ensure a Delaunay mesh output. Multiresolution Delaunay meshes can be obtained

View PDFchevron_right
Centroidal Voronoi Tessellations for Mesh Generation: From Uniform to Anisotropic Adaptive Triangulations
Hoa Nguyen
View PDFchevron_right
Boundary Refinement in Delaunay Mesh Generation Using Arbitrarily Ordered Vertex Insertion
Demian Nave

In general, guaranteed-quality Delaunay meshing algo- rithms are dicult to parallelize because they require strictly ordered updates to the mesh boundary. We show that, by replacing the Delaunay cavity in the Bowyer-Watson algorithm with what we call the cir- cumball intersection set, updates to the mesh can occur in any order, especially at the mesh boundary. To demonstrate this new idea, we describe a 2D con- strained Delaunay meshing algorithm that does not en- force strict ordering of vertex insertions near the mesh boundary. We prove that the sequential version of this algorithm generates a mesh in which the circumradius to shortest edge ratio of every triangle is p 2 or greater, as long as every angle interior to the polygonal input do- main is at least 90o. We briefly touch upon the parallel version of this algorithm, but we relegate a more com- plete discussion (with extension to 3D) to a forthcoming paper.

View PDFchevron_right
Efficient Delaunay Mesh Generation from Sampled Scalar Functions
Chandrajit Bajaj

Proceedings of the 16th International Meshing Roundtable, 2008

Many modern research areas face the challenge of meshing level sets of sampled scalar functions. While many algorithms focus on ensuring geometric qualities of the output mesh, recent attention has been paid to building topologically accurate Delaunay conforming meshes of any level set from such volumetric data.

View PDFchevron_right
A Practical Delaunay Meshing Algorithm for a Large Class of Domains*
Tamal Dey

Proceedings of the 16th International …, 2008

Recently a Delaunay refinement algorithm has been proposed that can mesh domains as general as piecewise smooth complexes . This class includes polyhedra, smooth and piecewise smooth surfaces, volumes enclosed by them, and above all non-manifolds. In contrast to previous approaches, the algorithm does not impose any restriction on the input angles. Although this algorithm has a provable guarantee about topology, certain steps are too expensive to make it practical.

View PDFchevron_right
Generalized Insertion Region Guides for Delaunay Mesh Refinement
Nikos Chrisochoides

SIAM Journal on Scientific Computing, 2012

Mesh generation by Delaunay refinement is a widely used technique for constructing guaranteed quality triangular and tetrahedral meshes. The quality guarantees are usually provided in terms of the bounds on circumradius-to-shortest edge ratio and on the grading of the resulting mesh. Traditionally circumcenters of skinny elements and middle points of boundary faces and edges are used for the positions of inserted points. However, recently variations of the traditional algorithms are being proposed that are designed to achieve certain optimization objectives by inserting new points in neighborhoods of the center points. In this paper we propose a general approach to the selection of point positions by defining one-, two-, and three-dimensional selection regions such that any point insertion strategy based on these regions is automatically endowed with the theoretical guarantees proven here. In particular, for the input models defined by planar linear complexes under the assumption that no input angle is less than 90 • , we prove the termination of the proposed generalized algorithm, as well as fidelity and good grading of the resulting meshes.

View PDFchevron_right
The Generation of Valid Curvilinear Meshes
Jonathan Lambrechts

Notes on Numerical Fluid Mechanics and Multidisciplinary Design, 2015

It is now well-known that a curvilinear discretization of the geometry is most often required to benefit from the computational efficiency of high-order numerical schemes in simulations. In this article, we explain how appropriate curvilinear meshes can be generated. We pay particular attention to the problem of invalid (tangled) mesh parts created by curving the domain boundaries. An efficient technique that computes provable bounds on the element Jacobian determinant is used to characterize the mesh validity, and we describe fast and robust techniques to regularize the mesh. The methods presented in this article are thoroughly discussed in Ref. , and implemented in the free mesh generation software Gmsh .

View PDFchevron_right
An approach to refining three-dimensional tetrahedral meshes based on Delaunay transformations
N Golias

International Journal for Numerical Methods in Engineering, 1994

A technique for refining three-dimensional tetrahedral meshes is proposed in this paper. The proposed technique is capable of treating arbitrary unstructured tetrahedral meshes, convex or non-convex with multiple regions resulting in high quality constrained Delaunay triangulations. The tetrahedra generated are of high quality (nearly equilateral). Sliver tetrahedra, which present a real problem to many algorithms are not produced with the new method. The key to the generation of high quality tetrahedra is the iterative application of a set of topological transformations based on the Voronoi-Delaunay theory and a reposition of nodes technique. The computational requirements of the proposed technique are in linear relationship with the number of nodes and tetrahedra, making it ideal for direct employment in a fully automatic finite element analysis system for 3-D adaptive mesh refinement. Application to some test problems is presented to show the effectiveness and applicability of the new method.

View PDFchevron_right

References (78)

  1. N. Amenta, M. Bern, D. Eppstein, Optimal point placement for mesh smoothing, J. Algorithms 30 (1999) 302-322.
  2. E. D'Azevedo, B. Simpson, On optimal triangular meshes for minimizing the gradient error, Numer. Math. 59 (1991) 321-348.
  3. P. Baehmann, L. Scott, L. Wittchen, M. Shephard, K. Grice, M. Yerry, Robust geometrically based, automatic two- dimensional mesh generation, Internat. J. Numer. Methods Engrg. 24 (1987) 1043-1078.
  4. R. Bank, Mesh smoothing using a posteriori estimates, SIAM J. Numer. Anal. 34 (1997) 979-997.
  5. E. Barnes, N. Sloane, The optimal Lattice quantizer in three dimensions, SIAM J. Algebraic Discrete Methods 4 (1983) 30-41.
  6. M. Berzins, A solution-based triangular and tetrahedral mesh quality indicator, SIAM J. Sci. Comput. 19 (1998) 2051-2069.
  7. A. Bowyer, Computing Dirichlet tessellations, Comput. J. 24 (1981) 162-166.
  8. H. Borouchaki, P. George, Aspects of 2-D Delaunay mesh generation, Internat. J. Numer. Methods Engrg. 40 (1997) 1957-1975.
  9. H. Borouchaki, P. George, F. Hecht, P. Laug, E. Saltel, Delaunay mesh generation governed by metric specifications. Part I, Algorithms 25 (1997) 61-83.
  10. H. Borouchaki, P. George, S. Lo, Optimal Delaunay point insertion, Internat. J. Numer. Methods Engrg. 39 (1996) 3407-3437.
  11. H. Borouchaki, S. Lo, Fast Delaunay triangulation in three dimensions, Comput. J. Numer. Methods. Engrg. 128 (1995) 153-167.
  12. H. Borouchaki, L. Patrick, P. George, Parametric surface meshing using a combined advancing-front generalized Delaunay approach, Internat. J. Numer. Methods Engrg. 49 (2000) 233-259.
  13. G. Buscaglia, E. Dari, Anisotropic mesh optimization and its application in adaptivity, Internat. J. Numer. Methods Engrg. 40 (1997) 4119-4136.
  14. L. Chew, Guaranteed quality mesh generation for curved surfaces, in: Proceedings of the Ninth Annual Computer Geometry, 1993, pp. 274-280.
  15. P. Ciarlet, Finite Element Methods, North-Holland, Amsterdam, 1975.
  16. Q. Du, M. Emelianenko, Uniform convergence of a nonlinear energy-based multilevel quantization scheme, preprint, 2005.
  17. Q. Du, M. Emelianenko, Acceleration schemes for computing centroidal Voronoi tessellations, preprint, 2005
  18. Q. Du, M. Emelianenko, L. Ju, Convergence properties of the Lloyd algorithm for computing the centroidal Voronoi tessellations, SIAM J. Numerical Analysis, 2005, accepted for publication.
  19. Q. Du, V. Faber, M. Gunzburger, Centroidal Voronoi tessellations: applications and algorithms, SIAM Rev. 41 (1999) 637-676.
  20. Q. Du, M. Gunzburger, Grid generation and optimization based on centroidal Voronoi tessellations, Appl. Comput. Math. 133 (2002) 591-607.
  21. Q. Du, M. Gunzburger, L. Ju, Probablistic methods for centroidal Voronoi tessellations and their parallel implementations, J. Parallel Comput. 28 (2002) 1477-1500.
  22. Q. Du, M. Gunzburger, L. Ju, Meshfree, probabilistic determination of point sets and support regions for meshless computing, Comput. Methods Appl. Mech. Engrg. 191 (2002) 1349-1366.
  23. Q. Du, M. Gunzburger, L. Ju, Constrained centroidal Voronoi tessellations on general surfaces, SIAM J. Sci. Comput. 24 (5) (2003) 1499-1506.
  24. Q. Du, Z. Huang, D. Wang, Mesh and solver coadaptation in finite element methods for anisotropic problems, Numer. Methods for Differential Equations 21 (2005) 859-874.
  25. Q. Du, L. Ju, Finite volume methods and spherical centroidal Voronoi tessellations, SIAM J. Numer. Anal., accepted for publication.
  26. Q. Du, D. Wang, Tetrahedral mesh generation and optimization based on centroidal Voronoi tessellations, Internat. J. Numer. Methods Engrg. 56 (2003) 1355-1373.
  27. Q. Du, D. Wang, Boundary recovery for three dimensional conforming Delaunay triangulation, Comput. Methods Appl. Mech. Engrg. 193 (2004) 2547-2563.
  28. Q. Du, D. Wang, Constrained boundary recovery for three dimensional Delaunay triangulation, Internat. J. Numer. Methods Engrg. 61 (2004) 1471-1500.
  29. Q. Du, D. Wang, Mesh optimization based on centroidal Voronoi tessellation, Internat. J. Numer. Anal. Modelling, 2004, accepted for publication.
  30. Q. Du, X. Wang, Centroidal Voronoi tessellation based algorithms for vector fields visualization and segmentation, IEEE Proceedings of Visualization 2004 (VIS2004), Austin, TX, 2004, pp. 43-50.
  31. Q. Du, D. Wang, On the optimal centroidal Voronoi tessellations and the Gersho's conjecture in the three dimensional space, Comput. Math. Appl. 49 (2005) 1355-1373.
  32. Q. Du, D. Wang, Anisotropic centroidal Voronoi tessellations and their applications, SIAM J. Sci. Comput. 26 (2005) 737-761.
  33. H. Edelsbrunner, D. Guoy, Sink insertion for mesh improvement, Internat. J. Foundations Comput. Sci. 13 (2002) 223-242.
  34. P. Frey, H. Borouchaki, Geometric surface mesh optimization, Comput. Visualization Sci. 1 (1998) 113-121.
  35. P. Frey, H. Borouchaki, P. George, 3D Delaunay mesh generation coupled with an advancing-front approach, Comput. Methods Appl. Mech. Engrg. 157 (1998) 115-131.
  36. P. Frey, L. Marechal, Fast adaptive quadtree mesh generation, in: Proceedings of the Seventh International Meshing Roundtable, 1998, pp. 211-222.
  37. A. George, Computer implementation of the finite element method, Ph.D. thesis, Standford University, STAN-CS-71-208, 1971.
  38. P. George, Gamanic3d, adaptive anisotropic tetrahedral mesh generator, Technical Report, INRIA, 2002.
  39. P. George, H. Borouchaki, Delaunay triangulation and meshing, Application to Finite Elements Methods, Hermès, Paris, 1998.
  40. P. George, H. Borouchaki, E. Saltel, Ultimate robustness in meshing an arbitrary polyhedron, Internat. J. Numer. Methods Engrg. 58 (2003) 1061-1089.
  41. P. George, F. Hecht, E. Saltel, Automatic mesh generation with specified boundary, Comput. Methods Appl. Mech. Engrg. 92 (1991) 169-188.
  42. A. Gersho, Asymptotically optimal block quantization, IEEE Trans. Inform. Theory 25 (1979) 373-380.
  43. F. Hermeline, Triangulation automatique d'un polyèdre en dimension, N.R.A.I.R.O. 16 (1982) 211-242.
  44. N. Hitschfeld, L. Villablanca, J. Krause, M.C. Rivara, Improving the quality of meshes for the simulation of semiconductor devices using Lepp-based algorithms, Internat. J. Numer. Methods Engrg. 58 (2003) 333-347.
  45. H. Hoppe, T. DeRose, T. Duchamp, J. McDonald, W. Stuetzle, Mesh optimization, ACM Comput. Graphics 27 (1993) 19-26.
  46. B. Karamete, M. Beall, M. Shephard, Triangulation of arbitrary polyhedra to support automatic mesh generators, Internat. J. Numer. Methods Engrg. 49 (2000) 167-191.
  47. P. Knupp, Achieving finite element mesh quality via optimization of the Jacobian matrix norm and associated quantities, I-a framework for surface mesh optimization, Internat. J. Numer. Methods Engrg. 48 (2000) 401-420.
  48. F. Labelle, J. Shewchuk, Anisotropic Voronoi Diagrams and Guaranteed-Quality Anisotropic Mesh Generation, SoCG 2003, San Diego.
  49. C. Lee, Automatic metric advancing front triangulation over curved surfaces, Eng. Comput. 17 (2000) 48-74.
  50. G. Leibon, D. Letscher, Delaunay triangulations and Voronoi diagrams for Riemannian manifolds, in: Proceedings of the 16th Annual Symposium on Computational Geometry (HK), ACM, New York, June 2000, pp. 341-349.
  51. X. Li, Sliver-free three dimensional Delaunay mesh generation, Ph.D thesis, UIUC, 2000.
  52. A. Liu, M. Baida, How far flipping can go towards 3D conforming/constrained triangulation, in: Proceedings of the Ninth International Meshing Roundtable, 2000.
  53. S. Lloyd, Least square quantization in PCM, IEEE Trans. Inform. Theory 28 (1982) 129-137.
  54. S. Lo, Volume discretization into tetrahedra-I, Verification and orientation of boundary surfaces, Comput. Structures 36 (1991) 493-500.
  55. S. Lo, Volume discretization into tetrahedra-II, 3D triangulation by advancing front approach, Comput. Structures 36 (1991) 501-511.
  56. R. Lohner, Progress in grid generation via the advancing front technique, Engrg. Comput. 12 (1996) 186-199.
  57. R. Lohner, C. Juan, Generation of non-isotropic unstructured grids via directional enrichment, Internat. J. Numer. Methods Engrg. 49 (1) (2000) 219-232.
  58. R. Lohner, P. Parikh, Generation of three-dimensional unstructured grids by the advancing-front method, Internat. J. Numer. Methods Engrg. 8 (1988) 1135-1149.
  59. J. MacQueen, Some methods for classification and analysis of multivariate observations, in: L. LeCam, J. Neyman (Eds.), Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, I, University of California, 1967, pp. 281-297.
  60. D. Marcum, N. Weatherill, Unstructured grid generation using iterative point insertion and local reconnection, AIAA J. 33 (9) (1995) 1625.
  61. D. Mavriplis, Directional coarsening and smoothing for anisotropic Navier-Stokes problems, Electron. Trans. Numer. Anal. 6 (1997) 182-197.
  62. K. Nakahashi, D. Sharov, Direct surface triangulation using the advancing front method, AIAA paper 95-1686-CP, 1995.
  63. D. Newman, The Hexagon theorem, IEEE Trans. Inform. Theory 28 (1982) 137-139.
  64. J. Peraire, J. Peiro, L. Formaggia, K. Morgan, O. Zienkiewicz, Finite element Euler computations in three dimensions, Internat. J. Numer. Methods Engrg. 26 (1988) 2135-2159.
  65. A. Rassineux, Generation and optimization of tetrahedral meshes by advancing front technique, Internat. J. Numer. Methods Engrg. 41 (1998) 651-674.
  66. S. Rippa, Long and thin triangles can be good for linear interpolation, SIAM J. Numer. Anal. 29 (1992) 257-270.
  67. W. Schroeder, M. Shephard, A combined octree/Delaunay method for fully automatic 3D mesh generation, Internat. J. Numer. Methods Engrg. 29 (1990) 37-55.
  68. M. Shephard, M. Georges, Automatic three-dimensional mesh generation by the finite Octree technique, Internat. J. Numer. Methods Engrg. 32 (1991) 709-749.
  69. J. Shewchuk, What is a good linear finite element? Interpolation, conditioning, anisotropy and quality measures. CS report, UC Berlekey.
  70. J. Shewchuk, Tetrahedral mesh generation by Delaunay refinement, in: 14th Annual ACM Symposium on Computational Geometry, 1998, pp. 86-95.
  71. J. Schewchuk, Constrained Delaunay tetrahedralization and provably good boundary recovery, in: Proceedings of the11th International Meshing Roundtable, 2002, pp. 193-204.
  72. K. Tchon, K. Mohammed, G. Francois, C. Ricardo, Constructing anisotropic geometric metrics using octrees and skeletons, in: Proceedings of the 12th International Meshing Roundtable, 2003, pp. 293-304.
  73. J. Thompson, B. Soni, N. Weatherill, Handbook of Grid Generation, CRC Press LLC, Boca Raton, FL, 1999.
  74. D. Watson, Computing the n-dimensional Delaunay tessellation with applications to Voronoi polytopes, Comput. J. 24 (1981) 167-172.
  75. N. Weatherill, The integrity of geometrical boundaries in the two-dimensional Delaunay triangulation, Comput. Appl. Numer. Methods 6 (1990) 101-109.
  76. N. Weatherill, O. Hassan, Efficient three dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints, Internat. J. Numer. Methods Engrg. 37 (1994) 2005-2039.
  77. J. Wright, A. Jack, Aspects of three-dimensional constrained Delaunay meshing, Internat. J. Numer. Methods Engrg. 37 (1994) 1841-1846.
  78. Y. Zhang, C. Bajaj, B. Sohn, 3D Finite Element Meshing from Imaging Data, Comput. Methods Appl. Mech. Eng., 2005, in press.

Related papers

Automatic mesh generation using a modified Delaunay tessellation
Jin-Fa Lee

IEEE Antennas and Propagation Magazine, 1997

View PDFchevron_right
CGALmesh: a Generic Framework for Delaunay Mesh Generation
Pierre Alliez

CGALmesh is the mesh generation software package of the Computational Geometry Algorithm Library (CGAL). It generates isotropic simplicial meshes-surface triangular meshes or volume tetrahedral meshes-from input surfaces, 3D domains as well as 3D multi-domains, with or without sharp features. The underlying meshing algorithm relies on restricted Delaunay triangulations to approximate domains and surfaces, and on Delaunay refinement to ensure both approximation accuracy and mesh quality. CGALmesh provides guarantees on approximation quality as well as on the size and shape of the mesh elements. It provides four optional mesh optimization algorithms to further improve the mesh quality. A distinctive property of CGALmesh is its high flexibility with respect to the input domain representation. Such a flexibility is achieved through a careful software design, gathering into a single abstract concept, denoted by the oracle, all required interface features between the meshing engine and the input domain. We already provide oracles for domains defined by polyhedral and implicit surfaces.

View PDFchevron_right
ASPECTS OF 2-D DELAUNAY MESH GENERATION
Paul George

International Journal for Numerical Methods in Engineering, 1997

This paper aims to outline the di erent phases necessary to implement a Delaunay-type automatic mesh generator. First, it summarizes this method and then describes a variant which is numerically robust by mentioning at the same time the problems to solve and the di erent solutions possible. The Delaunay insertion process by itself, the boundary integrity problem, the way to create the ÿeld points as well as the optimization procedures are discussed. The two-dimensional situation is described fully and possible extensions to the three-dimensional case are brie y indicated. ? 1997 by John Wiley & Sons, Ltd.

View PDFchevron_right
Delaunay mesh generation governed by metric specifications Part II. Applications
Houman Borouchaki, Patrick Laug

Finite Elements in Analysis and Design, 1997

This paper gives some application examples resulting from a governed Delaunay type mesh generation method. Isotropic and anisotropic cases are considered, these specifications being given via a metric map. The paper illustrates a study whose algorithmical aspects are described in a report referred to as part I. Academic examples as well as examples in CFD are discussed.

View PDFchevron_right
Tetrahedral mesh generation and optimization based on centroidal Voronoi tessellations
Desheng Wang

International Journal for Numerical Methods in Engineering, 2003

The centroidal Voronoi tessellation based Delaunay triangulation (CVDT) provides an optimal distribution of generating points with respect to a given density function and accordingly generates a high-quality mesh. In this paper, we discuss algorithms for the construction of the constrained CVDT from an initial Delaunay tetrahedral mesh of a three-dimensional domain. By establishing an appropriate relationship between the density function and the speciÿed sizing ÿeld and applying the Lloyd's iteration, the constrained CVDT mesh is obtained as a natural global optimization of the initial mesh. Simple local operations such as edges=faces ippings are also used to further improve the CVDT mesh. Several complex meshing examples and their element quality statistics are presented to demonstrate the e ectiveness and e ciency of the proposed mesh generation and optimization method. Copyright

View PDFchevron_right

Related topics

  • Mathematics
  • Applied Mathematics
  • Mesh generation
  • Applied Mathematics and Computat...
  • Robustness (evolution)
  • Mathematical Optimization
  • Numerical Analysis and Computati...
  • Mesh Optimization
  • Delaunay Triangulation
  • Electrical and Electronic Engine...

    • Cited by

    Projection-based guaranteed mesh generation algorithm
    Sergej Grigorjev

    Keldysh Institute Preprints

    О р д е н а Л е н и н а ИНСТИТУТ ПРИКЛАДНОЙ МАТЕМАТИКИ имени М.В.Келдыша Р о с с и й с к о й а к а д е м и и н а у к М.В. Якобовский, С.К. Григорьев Алгоритм гарантированной генерации тетраэдральной сетки проекционным методом Москва-2017 Якобовский М.В., Григорьев С.К. Алгоритм гарантированной генерации тетраэдральной сетки проекционным методом Рассматривается алгоритм построения тетраэдральной сетки. Принципиальное отличие алгоритма от других алгоритмов тетраэдризации состоит в гарантированности построения за конечное время. Рассматриваются основные этапы работы алгоритма, приводится оценка вычислительной сложности. Ключевые слова: неструктурированные сетки, генератор расчетных сеток, рациональные числа, триангуляция. Mikhail Vladimirovich Yakobovskiy, Sergej Konstantinovich Grigorjev Projection-based guaranteed mesh generation algorith Considered tetrahedral mesh generation algorithm. Principal difference from other algorithms consists in guaranteed filling of volume for a finite time. Considered main stages of algorithm, assessment of computational complexity is given.

    View PDFchevron_right
    A feature-aware SPH for isotropic unstructured mesh generation
    Xiangyu Hu

    Computer Methods in Applied Mechanics and Engineering, 2021

    In this paper, we present a feature-aware SPH method for the concurrent and automated isotropic unstructured mesh generation. Two additional objectives are achieved with the proposed method compared to the original SPH-based mesh generator (Fu et al., 2019). First, a feature boundary correction term is introduced to address the issue of incomplete kernel support at the boundary vicinity. The mesh generation of feature curves, feature surfaces and volumes can be handled concurrently without explicitly following a dimensional sequence. Second, a two-phase model is proposed to characterize the mesh-generation procedure by a feature-size-adaptation phase and a mesh-quality-optimization phase. By proposing a new error measurement criterion and an adaptive control system with two sets of simulation parameters, the objectives of faster feature-size adaptation and local mesh-quality improvement are merged into a consistent framework. The proposed method

    View PDFchevron_right
    Numerical Assessment of the Hybrid Approach for Simulating Three-Dimensional Flow and Advective Transport in Fractured Rocks
    Chuen-Fa Ni

    Applied Sciences, 2021

    This study presents a hybrid approach for simulating flow and advective transport dynamics in fractured rocks. The developed hybrid domain (HD) model uses the two-dimensional (2D) triangular mesh for fractures and tetrahedral mesh for the three-dimensional (3D) rock matrix in a simulation domain and allows the system of equations to be solved simultaneously. This study also illustrates the HD model with two numerical cases that focus on the flow and advective transport between the fractures and rock matrix. The quantitative assessments are conducted by comparing the HD results with those obtained from the discrete fracture network (DFN) and equivalent continuum porous medium (ECPM) models. Results show that the HD model reproduces the head solutions obtained from the ECPM model in the simulation domain and heads from the DFN model in the fractures in the first case. The particle tracking results show that the mean particle velocity in the HD model can be 7.62 times higher than that ...

    View PDFchevron_right
    580 California St., Suite 400
    San Francisco, CA, 94104
    © 2025 Academia. All rights reserved