When and why delaunay refinement algorithms work

Abstract

An "adaptive" variant of Ruppert 's Algorithm for producing quality triangular planar meshes is introduced. The algorithm terminates for arbitrary Planar Straight Line Graph (PSLG) input. The algorithm outputs a Delaunay mesh where no triangle has minimum angle smaller than about 26.45° except "across" from small angles of the input. No angle of the output… (More)
DOI: 10.1142/S0218195905001592

Topics

15 Figures and Tables

Cite this paper

@article{Miller2005WhenAW, title={When and why delaunay refinement algorithms work}, author={Gary L. Miller and Steven E. Pav and Noel Walkington}, journal={Int. J. Comput. Geometry Appl.}, year={2005}, volume={15}, pages={25-54} }