Automatic unstructured grid generation based on iterative point insertion
From MaRDI portal
Publication:1895655
DOI10.1007/BF02238098zbMath0831.68107OpenAlexW1562286121MaRDI QIDQ1895655
G. Hong, H. J. Thornburg, Bernd Hamann
Publication date: 13 August 1995
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02238098
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computer-aided design (modeling of curves and surfaces) (65D17)
Related Items
Tetrahedral mesh generation based on space indicator functions ⋮ An adaptive strategy for elliptic problems including a posteriori controlled boundary approximation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Properties of \(n\)-dimensional triangulations
- Computing optimal triangulations using simulated annealing
- Delaunay triangulation in computational fluid dynamics
- A data reduction scheme for triangulated surfaces
- Triangulation of scattered data in 3D space
- A method for generating irregular computational grids in multiply connected planar domains
- Generation of three‐dimensional unstructured grids by the advancing‐front method
- Scattered Data Interpolation: Tests of Some Method