Skip to main content
SpringerLink
Log in

A Review on Delaunay Refinement Techniques

  • Conference paper
Computational Science and Its Applications – ICCSA 2012 (ICCSA 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7333))

Included in the following conference series:

Abstract

Delaunay refinement is a technique for generating triangulations. Triangulations produced by algorithms in this class of techniques guarantee bounds on angles, edge lengths, the number and the grading of triangles in theory and practice. This paper is a brief review of point insertion techniques in Delaunay triangulations. Important works on the insertion of vertices in Delaunay triangulations and its dual graph, the Voronoi diagram, are described as a start point for one who needs to build a quality mesh using adaptive triangular-mesh refinement.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aurenhammer, F., Klein, R.: Handbook of Computational Geometry, ch. 5, Voronoi diagrams, from SFB Report F003-092, TU Graz, Austria, 1996, pp. 201–290. Elsevier Science Publishing (2000)

    Google Scholar 

  2. Babuka, I., Aziz, A.K.: On the angle condition in the finite element method. SIAM Journal on Numerical Analysis 13, 214–226 (1976)

    Article  MathSciNet  Google Scholar 

  3. Baker, T.J.: Triangulations, mesh generation and point placement strategies. In: Caughey, D. (ed.) Computing the Future, pp. 61–75. John Wiley (1995)

    Google Scholar 

  4. Ballard, D.H., Brown, C.M.: Computer Vision. Prentice Hall, Englewood Cliffs (1982)

    Google Scholar 

  5. Barth, T.J.: Aspects of unstructured grids and finite-volume solvers for the Euler and Navier-Stokes Equations. Von Karman Institute for Fluid Dynamics Lecture Series, NASA Ames Research Center, 1994-05 (February 1995)

    Google Scholar 

  6. Bern, M., Eppstein, D., Gilbert, J.R.: Provably good mesh generation. Journal of Computer and System Sciences 48(3), 384–409 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  7. Boots, B.N.: Delaunay triangles: An alternative approach to point pattern analysis. Proc. Assoc. Am. Geogr. 6, 26–29 (1974)

    Google Scholar 

  8. Borouchaki, H., George, P.L.: Aspects of 2-d Delaunay mesh generation. International Journal for Numerical Methods in Engineering 40, 1957–1975 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  9. Bowyer, A.: Computing dirichlet tessellations. The Computer Journal 24(2), 162–176 (1981)

    Article  MathSciNet  Google Scholar 

  10. Chernikov, A.N., Chrisochoides, N.P.: Generalized delaunay mesh refinement: From scalar to parallel. In: Proceedings of the 15th International Meshing Roundtable, pp. 563–580 (2006)

    Google Scholar 

  11. Chew, L.P.: Constrained Delaunay triangulation. Algorithmica 4, 97–108 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  12. Chew, L.P.: Guaranteed-quality mesh generation for curved surfaces. In: Proceedings of the Ninth Annual ACM Symposium on Computational Geometry, pp. 274–280. ACM Press, San Diego (1993)

    Chapter  Google Scholar 

  13. Clarkson, K.L., Shor, P.W.: Applications of random sampling in computational geometry ii. Discrete & Computational Geometry 4(1), 387–421 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  14. Cline, A.K., Renka, R.J.: A storage-efficient method for construction of a thiessen triangulation. Rocky Mountain Journal of Mathematics 14(1) (1984)

    Google Scholar 

  15. De Floriani, L.: Surface representation based on triangular grids. The Visual Computer, 27–48 (1987)

    Google Scholar 

  16. De Floriani, L., Bussi, S., Magillo, P.: Triangle-based surface models. In: Intelligent Systems and Robotics, ch. 9, pp. 340–373. Breach Science Publishers (2000)

    Google Scholar 

  17. De Floriani, L., Puppo, E.: A Hierarchical Triangle-Based Model for Terrain Description. In: Frank, A.U., Formentini, U., Campari, I., et al. (eds.) GIS 1992. LNCS, vol. 639, pp. 236–251. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  18. De Floriani, L., Puppo, E.: Extrating contour lines from a hierarchical surfase model. Computer Graphics Forum (Proc. Eurographics 1993) 12(3), 249–260 (1993)

    Article  Google Scholar 

  19. Delaunay, B.: Sur la sphère vide. Izvestia Akademii Nauk SSSR, Otdelenie Matematicheskikh i Estestvennykh Nauk 7, 793–800 (1934)

    Google Scholar 

  20. Dwyer, R.A.: A faster divide-and-conquer algorithm for constructing delaunay triangulations. Algorithmica 2(2), 137–151 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  21. Edelsbrunner, H.: Geometry and Topology for Mesh Generation. Cambridge Monographs on Applied and Computational Mathematics. Cambridge University Press, New York (2001)

    Book  MATH  Google Scholar 

  22. Edelsbrunner, H., Guoy, D.: Sink insertion for mesh improvement. In: Proceedings of the 17th ACM Symposium on Computational Geometry, pp. 115–123 (2001)

    Google Scholar 

  23. Erten, H., Üngör, A.: Computing acute and non-obtuse triangulations. In: Canadian Conference on Computational Geometry (CCCG), pp. 205–208 (2007)

    Google Scholar 

  24. Erten, H., Üngör, A.: Triangulations with locally optimal Steiner points. In: Belyaev, A., Garland, M. (eds.) Eurographics Symposium on Geometry Processing, pp. 143–152 (2007)

    Google Scholar 

  25. Erten, H., Üngör, A.: Quality triangulations with locally optimal steiner points. SIAM Journal of Scientfic Computing 31(3), 2103–2130 (2009)

    Article  MATH  Google Scholar 

  26. Farrashkhalvat, M., Miles, J.P.: Basic Structured Grid Generation with an introduction to unstructured grid generation. Butterworth-Heinemann (2003)

    Google Scholar 

  27. Fortune, S.: A sweepline algorithm for voronoi diagrams. Algorithmica 2(2), 153–174 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  28. Fowler, R.J., Little, J.J.: Automatic extraction of irregular network digital terrain models. ACM Computer Graphics (SIGGRAPH 1979 Proceedings) 13(3), 199–207 (1979)

    Article  Google Scholar 

  29. Frey, W.H.: Selective refinement: a new strategy for automatic node placement in graded triangular meshes. International Journal for Numerical Methods in Engineering 24, 2183–2200 (1987)

    Article  MATH  Google Scholar 

  30. George, P.L., Borouchaki, H.: Delaunay triangulation and meshing. Hermes (1998)

    Google Scholar 

  31. Gonzaga de Oliveira, S.L.: A survey of point insertion techniques in bidimensional delaunay triangulations. INFOCOMP Journal of Computer Science 10(2), 1–7 (2011)

    Google Scholar 

  32. Green, P.J., Sibson, R.R.: Computing Dirichlet tessellations in the plane. The Computer Journal 21(2), 168–173 (1977)

    MathSciNet  Google Scholar 

  33. Guibas, L.J., Stolfi, J.: Primitives for the manipulation of general subdivisions and the computation of Voronoi Diagrams. ACM Transactions on Graphics 4(2), 74–123 (1985)

    Article  MATH  Google Scholar 

  34. Har-Peled, S., Üngör, A.: A time-optimal delaunay refinement algorithm in two dimensions. In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, pp. 228–236 (2005)

    Google Scholar 

  35. Heckbert, P.S., Garland, M.: Survey of polygonal surface simplification algorithms. Technical report, Carnegie Mellon University - Department of Computer Science, May 1 (1997)

    Google Scholar 

  36. Hitschfeld, N., Rivara, M.C.: Automatic construction of non-obtuse boundary and/or interface Delaunay triangulations for control volume methods. International Journal for Numerical Methods in Engineering 55, 803–816 (2002)

    Article  MATH  Google Scholar 

  37. Hitschfeld, N., Villablanca, L., Krause, J., Rivara, M.C.: Improving the quality of meshes for the simulation of semiconductor devices using LEPP-based algorithms. International Journal for Numerical Methods in Engineering 58, 333–347 (2003)

    Article  MATH  Google Scholar 

  38. Joe, B.: Construction of three-dimensional triangulations using local transformations. Computer Aided Geometric Design 8, 123–142 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  39. Joe, B.: Construction of -dimensional delaunay triangulations using local transformations. SIAM J. on Scientific Computing 14(6), 1415–1436 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  40. Lawson, C.L.: Software for C1 surface interpolation. In: Rice, J.R. (ed.) Mathematical Software III, pp. 161–164. Academic Press (1977)

    Google Scholar 

  41. Lee, D.-T., Schachter, B.J.: Two algorithms for constructing the delaunay triangulation. International Journal of Computer and Information Science 9(3), 219–242 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  42. Miller, G.L., Pav, S.E., Walkington, N.J.: When and why Ruppert’s algorithm works. In: Twelfth Int. Meshing Roundtable, pp. 91–102 (September 2003)

    Google Scholar 

  43. Miller, G.L., Talmor, D., Teng, S.-H., Walkington, N.: A delaunay based numerical method for three dimensions: Generation, formulation, and partition. In: Proceedings of the Twenty-Seventh Annual ACM Symposium on the Theory of Computing, Las Vegas, Nevada (May 1995)

    Google Scholar 

  44. Miller, G.L., Pav, S.E., Walkington, N.J.: When and why Ruppert’s algorithm works. International Journal of Computational Geometry and Applications 15(1), 25–54 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  45. Mücke, E.P., Saias, I., Zhu, B.: Fast randomized point location without preprocessing in two- and three-dimensional delaunay triangulations. In: Proceedings of the Twelfth Annual Symposium on Computational Geometry (May 1996)

    Google Scholar 

  46. Pav, S.E., Walkington, N.J.: Delaunay refinement by corner lopping. In: Proceedings of the 14th International Meshing Roundtable, pp. 165–181 (2005)

    Google Scholar 

  47. Plaza, A., Márquez, A., Moreno-González, A., Suárez, J.P.: Local refinement based on the 7-triangle longest-edge partition. Mathematics and Computers in Simulation 79, 2444–2457 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  48. Rajan, V.T.: Optimality of the Delaunay triangulation in Rd. In: Proceedings of the 7th ACM Symposium on Computational Geometry, pp. 357–363 (1991)

    Google Scholar 

  49. Rebay, S.: Efficient unstructured mesh generation by means of delaunay triangulation and bowyer-watson algorithm. Journal of Computational Physics 106, 125–138 (1993)

    Article  MATH  Google Scholar 

  50. Rivara, M.C.: New longest-edge algorithms for the refinement and/or improvement of unstructured triangulations. International Journal for Numerical Methods in Engineering 40, 3313–3324 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  51. Rivara, M.C., Calderon, C.: LEPP terminal centroid method for quality triangulation. Computer-Aided Design 42, 58–66 (2010)

    Article  Google Scholar 

  52. Rivara, M.C., Hitschfeld, N., Simpson, B.: Terminal-edges Delaunay (small-angle based) algorithm for the quality triangulation problem. Computer-Aided Design 33, 263–277 (2001)

    Article  Google Scholar 

  53. Rivara, M.C., Inostroza, P.: Using longest-side bisection techniques for the automatic refinement of Delaunay triangulations. International Journal for Numerical Methods in Engineering 40, 581–597 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  54. Rivara, M.C., Iribarren, G.: The 4-triangles longest-side partition of triangles and linear refinement algorithms. Mathematics of Computation 65(126), 1485–1502 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  55. Rivara, M.C., Venere, M.: Cost analysis of the longest-side (triangle biection) refinement algorithms for triangulations. Eng. with Computers 12, 224–234 (1996)

    Article  Google Scholar 

  56. Ruppert, J.: A new and simple algorithm for quality 2-dimensional mesh generation. In: Proceedings of the Fourth ACM-SIAM Symposium on Discrete Algorithms, pp. 83–92 (1993)

    Google Scholar 

  57. Ruppert, J.: A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation. Journal of Algorithms 18(3), 548–585 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  58. Scarlatos, L., Pavlidis, T.: Hierarchical triangulation using cartographic coherence. CVGIP: Graphical Models and Image Processing 54(2), 147–161 (1992)

    Article  Google Scholar 

  59. Seidel, R.: Backwards analysis of randomized geometric algorithms. Technical Report TR-92-014, International Computer Science Institute, Berkeley, California (February 1992)

    Google Scholar 

  60. Shamos, M.I.: Computational geometry. PhD thesis, Yale University, New Haven, Conn. (1977)

    Google Scholar 

  61. Shewchuk, J.R.: Triangle: A two-dimensional quality mesh generator and delaunay triangulator, http://www.cs.cmu.edu/~quake/triangle.html

  62. Shewchuk, J.R.: Triangle: Engineering a 2D quality mesh generator and Delaunay triangulator. In: First Workshop on Applied Computational Geometry, pp. 124–133. ACM (1996)

    Google Scholar 

  63. Shewchuk, J.R.: Delaunay Refinement Mesh Generation. PhD thesis, Carnegie Mellon University, Computer Science Department (1997)

    Google Scholar 

  64. Shewchuk, J.R.: Lecture notes on Delaunay mesh generation (1999)

    Google Scholar 

  65. Shewchuk, J.R.: Delaunay refinement algorithms for triangular mesh generation. Computational Geometry 22, 21–74 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  66. Shewchuk, J.R.: Ruppert’s delaunay refinement algorithm. website (July 2005) (accessed September 2011)

    Google Scholar 

  67. Simpson, B., Hitschfeld, N., Rivara, M.C.: Approximate shape quality mesh generation. Engineering with Computers 17, 287–298 (2001)

    Article  MATH  Google Scholar 

  68. Sleator, D.D., Tarjan, R.E.: Self-adjusting binary search trees. Journal of the ACM 32(3), 652–686 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  69. Sloan, S.W.: A fast algorithm for constructing Delaunay triangulation in the plane. Advances in Engineering Software 9, 34–55 (1987)

    Article  MATH  Google Scholar 

  70. Tournois, J., Alliez, C.W.P., Desbrun, M.: Interleaving delaunay refinement and optimization for practical isotropic tetrahedron mesh generation. ACM Transactions on Graphics - Proceedings of ACM SIGGRAPH 2009 28(3), article no. 75 (2009)

    Google Scholar 

  71. Üngör, A.: Off-centers: A new type of Steiner points for computing size-optimal quality-guaranteed Delaunay triangulations. In: Proceedings of the Latin American Symposium on Theoretical Informatics, Buenos Aires, Argentina, pp. 152–161 (April 2004)

    Google Scholar 

  72. Üngör, A.: Off-centers: A new type of steiner points for computing size-optimal guaranteed-quality delaunay triangulations. Computational Geometry: Theory and Applications (CGTA) 42(2), 109–118 (2009)

    Article  MATH  Google Scholar 

  73. Voronoi, G.: Nouvelles applications des paramétres continus à la théorie des formes quadratiques. J. fur die Reine und Angewandte Mathematik 133, 97–178 (1907)

    Google Scholar 

  74. Watson, D.F.: Computing the n-dimensional delaunay tessellation with application to voronoi polytopes. The Computer Journal 24(2), 167–172 (1981)

    Article  MathSciNet  Google Scholar 

  75. Weatherill, N.P.: Delaunay triangulation in computational fluid dynamics. Computers and Mathematics with Applications 24(5/6), 129–150 (1992)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universidade Federal de Lavras, 37200-000, Lavras, MG, Brazil

    Sanderson L. Gonzaga de Oliveira

Authors
  1. Sanderson L. Gonzaga de Oliveira
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Laboratory of Urban and Territorial Systems, University of Basilicata, 10, Viale dell’Ateneo Lucano, 85100, Potenza, Italy

    Beniamino Murgante

  2. Department of Mathematics and Computer Science, University of Perugia, Via Vanvitelli 1, 06123, Perugia, Italy

    Osvaldo Gervasi

  3. Department of Cyber Security Science, Federal University of Technology, Gidan Kwano Campus, Minna, Nigeria

    Sanjay Misra

  4. Faculty of Engineering, Department of Electronics Engineering and Telecommunications, State University of Rio de Janeiro, Rua Sao Francisco Xavier, 524, 50. andar, sala 5145-F, Maracana, 20, 550-013, Rio de Janeiro, RJ, Brazil

    Nadia Nedjah

  5. Department of Production and Systems, University of Minho, Campus de Gualtar, 4710-057, Braga, Portugal

    Ana Maria A. C. Rocha

  6. School of Business Systems, Monash University, 3800, Clayton, VIC, Australia

    David Taniar

  7. Department of Intelligent Informatics, Kyushu Sangyo University, 2-3-1 Matsukadai, Higashi-ku, 813-8503, Fukuoka, Japan

    Bernady O. Apduhan

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gonzaga de Oliveira, S.L. (2012). A Review on Delaunay Refinement Techniques. In: Murgante, B., et al. Computational Science and Its Applications – ICCSA 2012. ICCSA 2012. Lecture Notes in Computer Science, vol 7333. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31125-3_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31125-3_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31124-6

  • Online ISBN: 978-3-642-31125-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation