Geometry‐based fully automatic mesh generation and the delaunay triangulation
- 1 November 1988
- journal article
- research article
- Published by Wiley in International Journal for Numerical Methods in Engineering
- Vol. 26 (11), 2503-2515
- https://doi.org/10.1002/nme.1620261109
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Selective refinement: A new strategy for automatic node placement in graded triangular meshesInternational Journal for Numerical Methods in Engineering, 1987
- A simple divide-and-conquer algorithm for computing Delaunay triangulations in O(n log log n) expected timePublished by Association for Computing Machinery (ACM) ,1986
- Implementing Watson's algorithm in three dimensionsPublished by Association for Computing Machinery (ACM) ,1986
- Automatic mesh generation for three-dimensional solidsComputers & Structures, 1985
- Primitives for the manipulation of general subdivisions and the computation of VoronoiACM Transactions on Graphics, 1985
- An apporach to automatic three‐dimensional finite element mesh generationInternational Journal for Numerical Methods in Engineering, 1985
- Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopesThe Computer Journal, 1981
- Computing Dirichlet tessellationsThe Computer Journal, 1981
- Computing Dirichlet Tessellations in the PlaneThe Computer Journal, 1978