Skip to main content
SpringerLink
Log in

Robust and Efficient Delaunay Triangulations of Points on Or Close to a Sphere

  • Conference paper
Experimental Algorithms (SEA 2010)

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

Included in the following conference series:

Abstract

We propose two ways to compute the Delaunay triangulation of points on a sphere, or of rounded points close to a sphere, both based on the classic incremental algorithm initially designed for the plane. We use the so-called space of circles as mathematical background for this work. We present a fully robust implementation built upon existing generic algorithms provided by the Cgal library. The efficiency of the implementation is established by benchmarks.

This work was partially supported by the ANR (Agence Nationale de la Recherche) under the “Triangles” project of the Programme blanc ANR-07-BLAN-0319 http://www.inria.fr/geometrica/collaborations/triangles/

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Hull, a program for convex hulls, http://www.netlib.org/voronoi/hull.html

  2. Qhull, http://www.qhull.org/

  3. Cgal, Computational Geometry Algorithms Library, http://www.cgal.org

  4. Core number library, http://cs.nyu.edu/exact/core_pages

  5. Leda, Library for efficient data types and algorithms, http://www.algorithmic-solutions.com/enleda.htm

  6. Three-dimensional convex hulls, http://www.simplex.t.u-tokyo.ac.jp/~sugihara/opensoft/opensofte.html

  7. IEEE standard for floating-point arithmetic. IEEE Std 754-2008, pp. 1–58 (August 2008)

    Google Scholar 

  8. Aurenhammer, F.: Power diagrams: properties, algorithms and applications. SIAM Journal of Computing 16, 78–96 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  9. Aurenhammer, F.: Voronoi diagrams: A survey of a fundamental geometric data structure. ACM Computing Surveys 23(3), 345–405 (1991)

    Article  Google Scholar 

  10. Berger, M.: The space of spheres. In: Geometry, vol. 1-2, pp. 349–361. Springer, Heidelberg (1987)

    Chapter  Google Scholar 

  11. Boissonnat, J.D., Yvinec, M.: Algorithmic Geometry. Cambridge University Press, UK (1998); Translated by Hervé Brönnimann

    MATH  Google Scholar 

  12. Bowyer, A.: Computing Dirichlet tessellations. The Computer Journal 24(2), 162–166 (1981)

    Article  MathSciNet  Google Scholar 

  13. Brown, K.Q.: Geometric transforms for fast geometric algorithms. Ph.D. thesis, Dept. Comput. Sci., Carnegie-Mellon Univ., Pittsburgh, PA, Report CMU-CS-80-101 (1980)

    Google Scholar 

  14. Buchin, K.: Constructing Delaunay triangulations along space-filling curves. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 119–130. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  15. Caroli, M., Teillaud, M.: 3D periodic triangulations. In: CGALial Editorial Bard (ed.) CGAL User and Reference Manual, 3.5 edn. (2009)

    Google Scholar 

  16. Caroli, M., Teillaud, M.: Computing 3D periodic triangulations. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 59–70. Springer, Heidelberg (2009); Full version available as INRIA Reserch Report No 6823, http://hal.inria.fr/inria-00356871

    Chapter  Google Scholar 

  17. Clarkson, K.L.: Safe and effective determinant evaluation. In: Proceedings 33rd Annual IEEE Symposium on Foundations of Computer Science, October 1992, pp. 387–395 (1992)

    Google Scholar 

  18. Clarkson, K.L., Mehlhorn, K., Seidel, R.: Four results on randomized incremental constructions. Computational Geometry: Theory and Applications 3(4), 185–212 (1993)

    MATH  MathSciNet  Google Scholar 

  19. Coxeter, H.S.M.: A geometrical background for de Sitter’s world. American Mathematical Monthly 50, 217–228 (1943)

    Article  MATH  MathSciNet  Google Scholar 

  20. de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications, 2nd edn. Springer, Berlin (2000)

    MATH  Google Scholar 

  21. de Castro, P.M.M., Cazals, F., Loriot, S., Teillaud, M.: 3D spherical geometry kernel. In: CGAL User and Reference Manual. CGAL Editorial Board, 3.5 edn. (2009)

    Google Scholar 

  22. de Castro, P.M.M., Cazals, F., Loriot, S., Teillaud, M.: Design of the CGAL 3D Spherical Kernel and application to arrangements of circles on a sphere. Computational Geometry: Theory and Applications 42(6-7), 536–550 (2009)

    MATH  MathSciNet  Google Scholar 

  23. Delage, C.: Spatial sorting. In: CGAL Editorial Board (ed.) CGAL User and Reference Manual, 3.5 edn. (2009)

    Google Scholar 

  24. Devillers, O., Meiser, S., Teillaud, M.: The space of spheres, a geometric tool to unify duality results on Voronoi diagrams. In: Proceedings 4th Canadian Conference on Computational Geometry, pp. 263–268 (1992); Full version available as INRIA Research Report No 1620, http://hal.inria.fr/inria-00074941

  25. Fogel, E., Setter, O.: Software for Voronoi diagram on a sphere. Personal communication

    Google Scholar 

  26. Fogel, E., Setter, O., Halperin, D.: Exact implementation of arrangements of geodesic arcs on the sphere with applications. In: Abstracts of 24th European Workshop on Computational Geometry, pp. 83–86 (2008)

    Google Scholar 

  27. Goldberg, D.: What every computer scientist should know about floating-point arithmetic. ACM Computing Surveys 23(1), 5–48 (1991)

    Article  Google Scholar 

  28. Hert, S., Schirra, S.: 3D convex hulls. In: CGAL Editorial Board (ed.) CGAL User and Reference Manual, 3.5 edn. (2009)

    Google Scholar 

  29. Kettner, L., Mehlhorn, K., Pion, S., Schirra, S., Yap, C.: Classroom examples of robustness problems in geometric computations. Computational Geometry: Theory and Applications 40, 61–78 (2008)

    MATH  MathSciNet  Google Scholar 

  30. Lawson, C.L.: Software for C 1 surface interpolation. In: Rice, J.R. (ed.) Math. Software III, pp. 161–194. Academic Press, New York (1977)

    Google Scholar 

  31. Li, C., Pion, S., Yap, C.K.: Recent progress in exact geometric computation. Journal of Logic and Algebraic Programming 64(1), 85–111 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  32. Muller, J.M.: On the definition of \(\mbox{ulp}(x)\). Research Report 5504, INRIA (February 2005), http://hal.inria.fr/inria-00070503/

  33. Na, H.S., Lee, C.N., Cheong, O.: Voronoi diagrams on the sphere. Computational Geometry: Theory and Applications 23, 183–194 (2002)

    MATH  MathSciNet  Google Scholar 

  34. Pion, S., Teillaud, M.: 3D triangulation data structure. In: CGAL Editorial Board (ed.) CGAL User and Reference Manual, 3.5 edn. (2009)

    Google Scholar 

  35. Pion, S., Teillaud, M.: 3D triangulations. In: CGAL Editorial Board (ed.) CGAL User and Reference Manual, 3.5 edn. (2009)

    Google Scholar 

  36. Pion, S., Yvinec, M.: 2D triangulation data structure. In: CGAL Editorial Board (ed.) CGAL User and Reference Manual, 3.5 edn. (2009)

    Google Scholar 

  37. Renka, R.J.: Algorithm 772: STRIPACK: Delaunay triangulation and Voronoi diagram on the surface of a sphere. ACM Transactions on Mathematical Software 23(3), 416–434 (1997), Software available at http://orion.math.iastate.edu/burkardt/f_src/stripack/stripack.html

    Article  MATH  MathSciNet  Google Scholar 

  38. Sugihara, K.: Laguerre Voronoi diagram on the sphere. Journal for Geometry and Graphics 6(1), 69–81 (2002)

    MATH  MathSciNet  Google Scholar 

  39. Yap, C.K., Dubé, T.: The exact computation paradigm. In: Du, D.-Z., Hwang, F.K. (eds.) Computing in Euclidean Geometry, 2nd edn. Lecture Notes Series on Computing, vol. 4, pp. 452–492. World Scientific, Singapore (1995)

    Google Scholar 

  40. Yvinec, M.: 2D triangulations. In: CGAL Editorial Board (ed.) CGAL User and Reference Manual, 3.5 edn. (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. INRIA Sophia Antipolis, Méditerranée, France

    Manuel Caroli, Pedro M. M. de Castro, Sébastien Loriot, Olivier Rouiller & Monique Teillaud

  2.  , ETH Zürich, Switzerland

    Camille Wormser

Authors
  1. Manuel Caroli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pedro M. M. de Castro
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sébastien Loriot
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Olivier Rouiller
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Monique Teillaud
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Camille Wormser
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and Applications, University of Napoli Federico II, Compl. MSA, Via Cintia, 80126, Napoli, Italy

    Paola Festa

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Caroli, M., de Castro, P.M.M., Loriot, S., Rouiller, O., Teillaud, M., Wormser, C. (2010). Robust and Efficient Delaunay Triangulations of Points on Or Close to a Sphere. In: Festa, P. (eds) Experimental Algorithms. SEA 2010. Lecture Notes in Computer Science, vol 6049. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13193-6_39

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13193-6_39

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13192-9

  • Online ISBN: 978-3-642-13193-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation