An advancing front Delaunay triangulation algorithm designed for robustness

DOI10.1006/jcph.1995.1047zbMath0815.68121OpenAlexW1997013090MaRDI QIDQ1346560

Dimitri J. Mavriplis

Publication date: 5 April 1995

Published in: Journal of Computational Physics (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2060/19930003212

zbMATH Keywords

Delaunay triangulationadvancing-front-type mesh generation strategies

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (14)

Generalized prism grid: a pillar-based unstructured grid for simulation of reservoirs with complicated geological geometries ⋮ On the immersed boundary method: finite element versus finite volume approach ⋮ Agglomeration multigrid methods with implicit Runge-Kutta smoothers applied to aerodynamic simulations on unstructured grids ⋮ How to teach neural networks to mesh: application on 2-D simplicial contours ⋮ Interior boundary-aligned unstructured grid generation and cell-centered versus vertex-centered CVD-MPFA performance ⋮ A versatile sharp interface immersed boundary method for incompressible flows with complex boundaries ⋮ Improved atomic meshes ⋮ Adaptive multi‐resolution triangulations based on physical compression ⋮ A surface remeshing approach ⋮ Triangulation of \(p\)-order parametric surfaces ⋮ Three-dimensional unstructured gridding for complex wells and geological features in subsurface reservoirs, with CVD-MPFA discretization performance ⋮ Multigrid strategies for viscous flow solvers on anisotropic unstructured meshes ⋮ Unstructured MEL modelling of nonlinear unsteady ship waves ⋮ Breakthrough `workarounds' in unstructured mesh generation

This page was built for publication: An advancing front Delaunay triangulation algorithm designed for robustness