Efficiently updating constrained delaunay triangulations
A description of the core three-dimensional mesh generation algorithm used in Pyramid, for those who want a quick overview with less detail.
A more thorough treatment appears in Chapter 4 of my dissertation.
A short paper on Triangle, for those who want a quick overview with less detail.
All this material is scattered through my dissertation as well.
Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator, in Applied Computational Geometry: Towards Geometric Engineering (Ming C.
Lin and Dinesh Manocha, editors), volume 1148 of Lecture Notes in Computer Science, pages 203-222, Springer-Verlag (Berlin), May 1996.
Greatest personal satisfaction: Constrained Delaunay Triangulations, I: Combinatorial Properties. This report is an exercise in trying to make a difficult subject as transparent and easy to understand as humanly possible.
See the Triangle page for information about what Triangle can do, or to obtain the C source code.
The best triangulations for interpolation and numerical modeling are often anisotropic: long and skinny, oriented in directions dictated by the function being approximated. ” papers below for details.) The ideal orientations and aspect ratios of the elements may vary greatly from one position to another.