Delaunay Refinement by Corner Lopping

  • Steven E. Pav
  • Noel J. Walkington
Conference paper

Summary

An algorithm for quality Delaunay meshing of 2D domains with curved boundaries is presented. The algorithm uses Ruppert’s “corner lopping” heuristic [MR96b:65137]. In addition to admitting a simple termination proof, the algorithm can accept curved input without any bound on the tangent angle between adjoining curves. In the limit case, where all curves are straight line segments, the algorithm returns a mesh with a minimum angle of arcsin (\({1 \mathord{\left/ {\vphantom {1 2}} \right. \kern-\nulldelimiterspace} 2}\sqrt 2 \)), except “near” input corners. Some loss of output quality is experienced with the use of curved input, but this loss is diminished for smaller input curvature.

Key words

unstructured simplicial planar curved boundary Delaunay mesh 
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [MR96b:65137]
    Ruppert J. “A Delaunay refinement algorithm for quality 2-dimensional mesh generation.” J. Algorithms, vol. 18, no. 3, 548–585, 1995.Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)(Austin, TX, 1993)MATHMathSciNetCrossRefGoogle Scholar
  2. [Pse2003]
    Pav S.E. Delaunay Refinement Algorithms. Ph.D. thesis, Department of Mathematics, Carnegie Mellon University, Pittsburgh, Pennsylvania, May 2003. URL http://www.math.cmu.edu/\~{}nw0z/publications/phdtheses/pav/p%avabsGoogle Scholar
  3. [Sjr1997]
    Shewchuk J.R. Delaunay Refinement Mesh Generation. Ph.D. thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania, May 1997. Available as Technical Report CMU-CS-97-137Google Scholar
  4. [MglPseWnj2005]
    Miller G.L., Pav S.E., Walkington N.J. “When and Why Delaunay Refinement Algorithms Work.” Internat. J. Comput. Geom. Appl., vol. 15,no. 1, 25–54, 2005. Special Issue: Selected Papers from the 12th International Meshing Roundtable, 2003MathSciNetCrossRefGoogle Scholar
  5. [BcOGc:2002]
    Boivin C., Ollivier-Gooch C.F. “Guaranteed-Quality Triangular Mesh Generation For Domains with Curved Boundaries.” Internat. J. Numer. Methods Eng., vol. 55, no. 10, 1185–1213, 2002CrossRefGoogle Scholar
  6. [MglPseWnj2002c]
    Miller G.L., Pav S.E., Walkington N.J. “Fully Incremental 3D Delaunay Mesh Generation.” Proceedings of the 11th International Meshing Roundtable, pp. 75–86. Sandia National Laboratory, September 2002Google Scholar
  7. [338236]
    Murphy M., Mount D.M., Gable C.W. “A point-placement strategy for conforming Delaunay tetrahedralization.” Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, pp. 67–74. Society for Industrial and Applied Mathematics, 2000Google Scholar
  8. [CoVeYv01]
    Cohen-Steiner D., de Verdiere E.C., Yvinec M. “Conforming Delaunay Triangulations in 3D.” CS 4345, INRIA, 2001Google Scholar
  9. [Cswetal2004]
    Cheng S.W., Dey T.K., Ramos E.A., Ray T. “Quality meshing for polyhedra with small angles.” SCG’ 04: Proceedings of the Twentieth Annual Symposium on Computational Geometry, pp. 290–299. ACM Press, 2004Google Scholar
  10. [PseWnj2004]
    Pav S.E., Walkington N.J. “Robust Three Dimensional Delaunay Refinement.” Proceedings of the 13th International Meshing Roundtable, pp.145–156. Sandia National Laboratory, September 2004Google Scholar
  11. [BaAz76]
    Babušska I., Aziz A.K. “On the angle condition in the finite element method.” SIAM J. Numer. Anal., vol. 13, no. 2, 214–226, 1976MathSciNetCrossRefGoogle Scholar
  12. [Ci78]
    Ciarlet P.G. The Finite Element Method for Elliptic Problems. North-Holland, 1978Google Scholar
  13. [AnCsKrk2001]
    Amenta N., Choi S., Kolluri R.K. “The power crust.” SMA’ 01: Proceedings of the sixth ACM symposium on Solid modeling and applications,pp. 249–266. ACM Press, New York, NY, USA, 2001Google Scholar
  14. [Fa2001]
    Fabri A. “CGAL-The Computational Geometry Algorithm Library.”Proceedings of the 10th International Meshing Roundtable, pp. 137–142. Sandia National Laboratory, October 2001Google Scholar
  15. [MR1974932]
    Cheng S.W., Poon S.H. “Graded conforming Delaunay tetrahedralization with bounded radius-edge ratio.” Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Baltimore, MD, 2003), pp.295–304. ACM, New York, 2003Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Steven E. Pav
    • 1
  • Noel J. Walkington
    • 2
  1. 1.University of California at San DiegoLa JollaUSA
  2. 2.Carnegie Mellon UniversityPittsburghUSA

Personalised recommendations