CMU Campus
Center for                           Nonlinear Analysis
CNA Home People Seminars Publications Workshops and Conferences CNA Working Groups CNA Comments Form Summer Schools Summer Undergraduate Institute PIRE Cooperation Graduate Topics Courses SIAM Chapter Seminar Positions Contact
Publication 02-CNA-11

An Incremental Delaunay Meshing Algorithm

Gary L. Miller
Department of Computer Science
Carnegie Mellon University
Pittsburgh, PA 15213

Steven E. Pav
Department of Mathematical Sciences
Carnegie Mellon University
Pittsburgh, PA 15213

Noel J. Walkington
Department of Mathematical Sciences
Carnegie Mellon University
Pittsburgh, PA

Abstract: The classical meshing problem is to construct a triangulation of a region that conforms to the boundary, is as coarse as possible, and is constructed from simplices having bounded aspect ratio. In this paper we present an implementation of a class of algorithms introduced by Ruppert and establish their correctness. This class of algorithms solves the meshing problem in two dimensions, and partially solve it in three dimensions. Since geometric degeneracies frequently cause such algorithms to fail, care is taken to accommodate these in the proofs.

Get the paper in its entirety as

Back to CNA Publications