Automatic mesh generation using a modified Delaunay tessellation
- 1 January 1997
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Antennas and Propagation Magazine
- Vol. 39 (1) , 34-45
- https://doi.org/10.1109/74.583517
Abstract
The authors begin by discussing the Delauny triangulation and algorithms for its construction. Degeneracy and the convexity check are then considered together with the preservation of edge boundaries. Swapping in two and three dimensions, edge subdivisions, mesh smoothing techniques and the mesh generation algorithm are also discussed.Keywords
This publication has 15 references indexed in Scilit:
- Tetrahedral mesh generation in convex primitives by maximizing solid anglesIEEE Transactions on Magnetics, 1994
- Tangential vector finite elements for electromagnetic field computationIEEE Transactions on Magnetics, 1991
- A hierarchical approach to automatic finite element mesh generationInternational Journal for Numerical Methods in Engineering, 1991
- An efficient advancing front algorithm for Delaunay triangulationPublished by American Institute of Aeronautics and Astronautics (AIAA) ,1991
- Constrained delaunay triangulationsAlgorithmica, 1989
- Geometry‐based fully automatic mesh generation and the delaunay triangulationInternational Journal for Numerical Methods in Engineering, 1988
- Properties of n-dimensional triangulationsComputer Aided Geometric Design, 1986
- A new algorithm for three-dimensional voronoi tessellationJournal of Computational Physics, 1983
- Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopesThe Computer Journal, 1981
- Transforming triangulationsDiscrete Mathematics, 1972