Abstract
Two constrained Delaunay triangulation methods based on local reconstruction and side-swapping method are presented. Their convergence are shown. Appointed fields are renewed by boundary indicating method. It updates field scales by analysis of boundary curvature, axial and mutual smooth gradient of the domain. Based on Spring method, boundary points according to field scales are generated. By sign-area function and probability filer, initial points of field are obtained. Structure of meshes is optimized by Spring-Laplace method, side-swapping and side-collapse methods. The methods can be adaptive refined and made sparse successfully. They can be used to moving mesh and surface mesh generation of reflection surface.
| Original language | English |
|---|---|
| Pages (from-to) | 335-348 |
| Number of pages | 14 |
| Journal | Jisuan Wuli/Chinese Journal of Computational Physics |
| Volume | 26 |
| Issue number | 3 |
| State | Published - May 2009 |
Keywords
- Adaptive
- Constrained Delaunay method
- Discrete boundary
- Scale
- Unstructured mesh
Fingerprint
Dive into the research topics of 'Two-dimensional unstructured mesh generation with constrained Delaunay triangulations'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver