Advertisement

An Experimental Assessment of Three Point-Insertion Sequences for 3-D Incremental Delaunay Tessellations

  • Sanderson L. Gonzaga de Oliveira
  • Diogo T. Robaina
  • Diego N. Brandão
  • Mauricio Kischinhevsky
  • Gabriel Oliveira
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10860)

Abstract

Currently, state-of-the-art algorithms for building 3-D Delaunay tessellations are incremental. Thus, their execution costs depend on the order of point insertion. This work evaluates three point-insertion sequences in incremental algorithms for building 3-D Delaunay tessellations. An incremental algorithm with point-insertion sequence provided by the cut-longest-edge kd–tree is evaluated against the BRIO–Hilbert order in conjunction with spatial middle and median policies employed in the 4.11 version of the Computational Geometry Algorithms Library. The results of computational costs (time and space) of these three algorithms are evaluated experimentally. Extensive results show that the incremental algorithm with a point-insertion sequence provided by the BRIO–Hilbert order with spatial middle policy employed in the latest version of the Computational Geometry Algorithms Library shows lower execution and storage costs than the two other algorithms evaluated.

Notes

Acknowledgements

We are grateful to Prof. Dr. Jianfei Liu, from the Department of Mechanics and Engineering Science, College of Engineering, Peking University, for sharing his program code and for his helpful comments.

References

  1. 1.
    Amenta, N., Choi, S., Rote, G.: Incremental constructions con BRIO. In: Proceedings of the Nineteenth Annual Symposium on Computational Geometry, SCG 2003, pp. 211–219. ACM, San Diego, June 2003Google Scholar
  2. 2.
    Artec3D. Artec3D (2018). https://www.artec3d.com/3d-models
  3. 3.
    Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18(9), 509–517 (1975)CrossRefGoogle Scholar
  4. 4.
    Boissonnat, J.D., Devillers, O., Samuel, H.: Incremental construction of the Delaunay graph in medium dimension. In: Proceedings of the Twenty-Fifth Annual Symposium on Computational Geometry, SCG 2009, Aarhus, Denmark, pp. 208–216. ACM, June 2009Google Scholar
  5. 5.
    Buchin, K.: Constructing Delaunay triangulations along space-filling curves. In: Proceedings of the 2nd International Symposium Voronoi Diagrams (ISVD) in Science and Engineering, Seoul, Korea, pp. 184–195 (2005)Google Scholar
  6. 6.
    Buchin, K.: Organizing point sets: Space-filling curves, Delaunay tessellations of random point sets, and flow complexes. Ph.D. thesis, Free University, Berlin (2007)Google Scholar
  7. 7.
    Gonzaga de Oliveira, S.L., Nogueira, J.R.: An evaluation of point-insertion sequences for incremental Delaunay tessellations. Comput. Appl. Math. 37(1), 641–674 (2018)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Gonzaga de Oliveira, S.L., Nogueira, J.R., Tavares, J.M.R.S.: A systematic review of algorithms with linear-time behaviour to generate Delaunay and Voronoi tessellations. CMES - Comput. Model. Eng. Sci. 100(1), 31–57 (2014)MathSciNetzbMATHGoogle Scholar
  9. 9.
    Liu, J.-F., Yan, J.-H., Lo, S.H.: A new insertion sequence for incremental Delaunay triangulation. Acta Mechanica Sinica 29(1), 99–109 (2013)CrossRefGoogle Scholar
  10. 10.
    Liu, Y., Snoeyink, J.: A comparison of five implementations of 3D Delaunay tessellation. In: Goodman, J.E., Pach, J., Welzl, E. (eds.) Combinatorial and Computational Geometry, vol. 52, pp. 439–458. MSRI Publications, Cambridge (2005)Google Scholar
  11. 11.
    Schrijvers, O., van Bommel, F., Buchin, K.: Delaunay triangulations on the word RAM: towards a practical worst-case optimal algorithm. In: Proceedings of the 10th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD), Saint Petersburg, Russia, pp. 7–15 (2013)Google Scholar
  12. 12.
    The CGAL Project. CGAL User and Reference Manual. CGAL Editorial Board, 4.11 edition (2017). http://doc.cgal.org/4.11/Manual/packages.html
  13. 13.
    The Stanford Models. The Stanford 3D Scanning Repository (2014). http://graphics.stanford.edu/data/3Dscanrep
  14. 14.
    Zhou, S., Jones, C.B.: HCPO: an efficient insertion order for incremental Delaunay triangulation. Inf. Process. Lett. 93, 37–42 (2005)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  • Sanderson L. Gonzaga de Oliveira
    • 1
  • Diogo T. Robaina
    • 2
  • Diego N. Brandão
    • 3
  • Mauricio Kischinhevsky
    • 2
  • Gabriel Oliveira
    • 1
  1. 1.Universidade Federal de LavrasLavrasBrazil
  2. 2.Universidade Federal FluminenseNiteróiBrazil
  3. 3.CEFET-RJRio de JaneiroBrazil

Personalised recommendations