Skip to main content

A Compact Parallel Algorithm for Spherical Delaunay Triangulations

  • Conference paper
  • First Online:
Parallel Processing and Applied Mathematics

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

Abstract

We present a data-parallel algorithm for the construction of Delaunay triangulations on the sphere. Our method combines a variant of the classical Bowyer-Watson point insertion algorithm [2, 14] with the recently published parallelization technique by Jacobsen et al. [7]. It resolves a breakdown situation of the latter approach and is suitable for practical implementation due to its compact formulation. Some complementary aspects are discussed such as the parallel workload, floating-point arithmetics and an application to interpolation of scattered data.

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

Access this chapter

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 EPUB and 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

References

  1. Bourke, P.: Efficient triangulation algorithm suitable for terrain modelling or an algorithm for interpolating irregularly-spaced data with applications in terrain modelling. In: Pan Pacific Computer Conference, Beijing, China (1989)

    Google Scholar 

  2. Bowyer, A.: Computing Dirichlet tessellations. Comput. J. 24(2), 162–166 (1981)

    Article  MathSciNet  Google Scholar 

  3. Burnikel, C., Funke, S., Seel, M.: Exact geometric computation using cascading. IJCGA 11(3), 245–266 (2001)

    MathSciNet  MATH  Google Scholar 

  4. Carfora, M.F.: Interpolation on spherical geodesic grids: a comparative study. J. Comput. Appl. Math. 210(1–2), 99–105 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  5. de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer, Heidelberg (2008)

    Book  MATH  Google Scholar 

  6. Fasshauer, G.E., Schumaker, L.L.: Scattered data fitting on the sphere. In: Fasshauerand, G.E. (ed.) Mathematical Methods for Curves and Surfaces II, pp. 117–166. Vanderbilt University Press, Nashville (1998)

    Google Scholar 

  7. Jacobsen, D.W., Gunzburger, M., Ringler, T., Burkardt, J., Peterson, J.: Parallel algorithms for planar and spherical Delaunay construction with an application to centroidal Voronoi tessellations. Geosci. Model Dev. 6(4), 1353–1365 (2013)

    Article  Google Scholar 

  8. Ju, L., Ringler, T., Gunzburger, M.: Voronoi tessellations and their application to climate and global modeling. In: Lauritzen, P., Jablonowski, C., Taylor, M., Nair, R. (eds.) Numerical Techniques for Global Atmospheric Models. Lecture Notes in Computational Science and Engineering, vol. 80, pp. 313–342. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  9. Lawson, C.L.: \(C^1\) surface interpolation for scattered data on a sphere. Rocky Mt. J. Math. 14(1), 177–202 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  10. Rakhmanov, E.A., Saff, E., Zhou, Y.: Minimal discrete energy on the sphere. Math. Res. Lett 1(6), 647–662 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  11. Renka, R.J.: Interpolation of data on the surface of a sphere. ACM Trans. Math. Softw. 10(4), 417–436 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  12. Renka, R.J.: Algorithm 772: STRIPACK: Delaunay triangulation and voronoi diagram on the surface of a sphere. ACM Trans. Math. Softw. 23(3), 416–434 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  13. Shewchuk, J.R.: Lecture notes on Delaunay mesh generation. Department of Electrical Engineering and Computer Sciences, University of California at Berkeley (2012)

    Google Scholar 

  14. Watson, D.F.: Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopes. Comput. J. 24(2), 167–172 (1981)

    Article  MathSciNet  Google Scholar 

  15. Zängl, G., Reinert, D., Rípodas, P., Baldauf, M.: The ICON (ICOsahedral Non-hydrostatic) modelling framework of DWD and MPI-M: description of the non-hydrostatic dynamical core. Q. J. R. Meteorol. Soc. 141(687), 563–579 (2015)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Florian Prill .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Prill, F., Zängl, G. (2016). A Compact Parallel Algorithm for Spherical Delaunay Triangulations. In: Wyrzykowski, R., Deelman, E., Dongarra, J., Karczewski, K., Kitowski, J., Wiatr, K. (eds) Parallel Processing and Applied Mathematics. Lecture Notes in Computer Science(), vol 9574. Springer, Cham. https://doi.org/10.1007/978-3-319-32152-3_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-32152-3_33

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-32151-6

  • Online ISBN: 978-3-319-32152-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics