Tetrahedral mesh generation in convex primitives
- 15 January 1995
- journal article
- Published by Wiley in International Journal for Numerical Methods in Engineering
- Vol. 38 (1) , 99-117
- https://doi.org/10.1002/nme.1620380107
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Delaunay's mesh of a convex polyhedron in dimension d. application to arbitrary polyhedraInternational Journal for Numerical Methods in Engineering, 1992
- Delaunay versus max-min solid angle triangulations for three-dimensional mesh generationInternational Journal for Numerical Methods in Engineering, 1991
- Graded tetrahedral finite element meshesInternational Journal for Numerical Methods in Engineering, 1991
- Efficient Delaunay triangulation using rational arithmeticACM Transactions on Graphics, 1991
- A combined octree/delaunay method for fully automatic 3‐D mesh generationInternational Journal for Numerical Methods in Engineering, 1990
- Geometry‐based fully automatic mesh generation and the delaunay triangulationInternational Journal for Numerical Methods in Engineering, 1988
- Whitney forms: a class of finite elements for three-dimensional computations in electromagnetismIEE Proceedings A Physical Science, Measurement and Instrumentation, Management and Education, Reviews, 1988
- 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