Skip to main content
SpringerLink
Log in
Book cover

Proceedings of the 20th International Meshing Roundtable pp 3–20Cite as

Dynamic Parallel 3D Delaunay Triangulation

  • Conference paper

Summary

Delaunay meshing is a popular technique for mesh generation. Usually, the mesh has to be refined so that certain fidelity and quality criteria are met. Delaunay refinement is achieved by dynamically inserting and removing points in/from a Delaunay triangulation. In this paper, we present a robust parallel algorithm for computing Delaunay triangulations in three dimensions. Our triangulator offers fully dynamic parallel insertions and removals of points and is thus suitable for mesh refinement. As far as we know, ours is the first method that parallelizes point removals, an operation that significantly slows refinement down. Our shared memory implementation makes use of a custom memory manager and light-weight locks which greatly reduce the communication and synchronization cost. We also employ a contention policy which is able to accelerate the execution times even in the presence of high number of rollbacks. Evaluation on synthetic and real data shows the effectiveness of our method on widely used multi-core SMPs.

This is a preview of subscription content, 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   259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   329.99
Price excludes VAT (USA)
  • Durable hardcover 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Boost C++ libraries, http://www.boost.org/

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

  3. Amato, N.M., Goodrich, M.T., Ramos, E.A.: Parallel algorithms for higher-dimensional convex hulls. In: IEEE Symposium on Foundations of Computer Science, November 1994, pp. 683–694 (1994)

    Google Scholar 

  4. Antonopoulos, C., Blagojevic, F., Chernikov, A., Chrisochoides, N., Nikolopoulos, D.: Algorithm, software, and hardware optimizations for delaunay mesh generation on simultaneous multithreaded architectures. Journal on Parallel and Distributed Computing 69(7), 601–612 (2009)

    Article  Google Scholar 

  5. Barker, K., Chrisochoides, N.: Practical performance model for optimizing dynamic load balancing of adaptive applications. In: IEEE International Parallel and Distributed Processing Symposium (IPDPS). IEEE Computer Society Press (2005)

    Google Scholar 

  6. Blandford, D.K., Blelloch, G.E., Kadow, C.: Engineering a compact parallel delaunay algorithm in 3d. In: Proceedings of the 22nd Symposium on Computational Geometry, SCG 2006, pp. 292–300. ACM, New York (2006)

    Chapter  Google Scholar 

  7. Blelloch, G.E., Miller, G.L., Hardwick, J.C., Talmor, D.: Design and implementation of a practical parallel delaunay algorithm. Algorithmica 24(3), 243–269 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  8. Boissonnat, J.-D., Oudot, S.: Provably good sampling and meshing of surfaces. Graphical Models 67(5), 405–451 (2005)

    Article  MATH  Google Scholar 

  9. Bowyer, A.: Computing Dirichlet tesselations. Computer Journal 24, 162–166 (1981)

    Article  MathSciNet  Google Scholar 

  10. Chernikov, A., Chrisochoides, N.: Three-Dimensional Semi-Generalized Point Placement Method for Delaunay Mesh Refinement. In: Proceedings of the 16th International Meshing Roundtable, Seattle, WA, October 2007, pp. 25–44. Elsevier, Amsterdam (2001)

    Google Scholar 

  11. Chernikov, A., Chrisochoides, N.: Three-dimensional delaunay refinement for multi-core processors. In: ACM International Conference on Supercomputing, Island of Kos, Greece, June 2008, vol. 22, pp. 214–224 (2008)

    Google Scholar 

  12. Paul Chew, L.: Guaranteed-quality Delaunay meshing in 3D. In: Proceedings of the 13th ACM Symposium on Computational Geometry, Nice, France, pp. 391–393 (1997)

    Google Scholar 

  13. Chrisochoides, N., Chernikov, A., Fedorov, A., Kot, A., Linardakis, L., Foteinos, P.: Towards exascale parallel delaunay mesh generation. In: International Meshing Roundtable, Salt Lake City, Utah, October 2009, vol. 18, pp. 319–336 (2009)

    Google Scholar 

  14. Cignoni, P., Montani, C., Perego, R., Scopigno, R.: Parallel 3d delaunay triangulation. Computer Graphics Forum 12(3), 129–142 (1993)

    Article  Google Scholar 

  15. Devillers, O.: The delaunay hierarchy. Internat. J. Found. Comput. Sci. 13, 163–180 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  16. Devillers, O., Pion, S., Teillaud, M.: Walking in a triangulation. In: Proceedings of the 17th Annual Symposium on Computational Geometry, SoCG 2001, pp. 106–114. ACM, New York (2001)

    Chapter  Google Scholar 

  17. Devillers, O., Teillaud, M.: Perturbations and vertex removal in a 3d delaunay triangulation. In: Proceedings of the 14th ACM-SIAM Symposium on Discrete algorithms, SODA 2003, Philadelphia, PA, USA, pp. 313–319. Society for Industrial and Applied Mathematics (2003)

    Google Scholar 

  18. Boltcheva, D., Yvinec, M., Boissonnat, J.-D.: Mesh Generation from 3D Multi-material Images. In: Yang, G.-Z., Hawkes, D., Rueckert, D., Noble, A., Taylor, C. (eds.) MICCAI 2009. LNCS, vol. 5762, pp. 283–290. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  19. Foteinos, P., Chernikov, A., Chrisochoides, N.: Guaranteed Quality Tetrahedral Delaunay Meshing for Medical Images. In: Proceedings of the 7th International Symposium on Voronoi Diagrams in Science and Engineering, Quebec City, Canada, June 2010, pp. 215–223 (2010)

    Google Scholar 

  20. Galtier, J., George, P.-L.: Prepartitioning as a way to mesh subdomains in parallel. Special Symposium on Trends in Unstructured Mesh Generation, pp. 107–122. ASME/ASCE/SES (1997)

    Google Scholar 

  21. George, P.-L., Borouchaki, H.: Delaunay triangulation and meshin. In: Application to finite elements. HERMES (1998)

    Google Scholar 

  22. Goksel, O., Salcudean, S.E.: Image-based variational meshing. IEEE Transactions on Medical Imaging 30(1), 11–21 (2011)

    Article  Google Scholar 

  23. Hardwick, J.C.: Implementation and evaluation of an efficient parallel delaunay triangulation algorithm. In: Proceedings of the 9th ACM Symposium on Parallel Algorithms and Architectures, pp. 239–248. ACM, New York (1997)

    Chapter  Google Scholar 

  24. Scherer III, W.N., Scott, M.L.: Advanced contention management for dynamic software transactional memory. In: Proceedings of the 24th Annual ACM Symposium on Principles of Distributed Computing, PODC 2005, pp. 240–248. ACM, New York (2005)

    Google Scholar 

  25. Kadow, C.M.J.: Parallel Delaunay Refinement Mesh Generation. PhD Thesis, Carnegie Mellon University (2004)

    Google Scholar 

  26. Klingner, B.M., Shewchuk, J.R.: Aggressive tetrahedral mesh improvement. In: Proceedings of the International Meshing Roundtable, pp. 3–23. Springer, Heidelberg (2007)

    Google Scholar 

  27. Kohout, J., Kolingerová, I., Žára, J.: Practically oriented parallel delaunay triangulation in E2 for computers with shared memory. Computers & Graphics 28(5), 703–718 (2004)

    Article  Google Scholar 

  28. Linardakis, L., Chrisochoides, N.: Graded delaunay decoupling method for parallel guaranteed quality planar mesh generation. SIAM Journal on Scientific Computing 30(4), 1875–1891 (2008)

    Article  MathSciNet  Google Scholar 

  29. 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 12th ACM Symposium on Computational Geometry, pp. 274–283 (1996)

    Google Scholar 

  30. Nave, D., Chew, P., Chrisochoides, N.: Guaranteed quality parallel delaunay refinement for restricted polyhedral domains. In: ACM Symposium on Computational Geometry (SoCG), July 2002, pp. 135–144 (2002)

    Google Scholar 

  31. Okusanya, T., Peraire, J.: 3d parallel unstructured mesh generation (1997), http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.7898

  32. Oudot, S., Rineau, L., Yvinec, M.: Meshing volumes bounded by smooth surfaces. In: Proceedings of the International Meshing Roundtable, San Diego, California, USA, September 2005, pp. 203–219. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  33. Pons, J.-P., Ségonne, F., Boissonnat, J.-D., Rineau, L., Yvinec, M., Keriven, R.: High-Quality Consistent Meshing of Multi-label Datasets. In: Information Processing in Medical Imaging, pp. 198–210 (2007)

    Google Scholar 

  34. Rineau, L., Yvinec, M.: Meshing 3d domains bounded by piecewise smooth surfaces. In: Proceedings of the International Meshing Roundtable, pp. 443–460 (2007)

    Google Scholar 

  35. Shewchuk, J.R.: Tetrahedral mesh generation by delaunay refinement. In: Proceedings of the 14th ACM Symposium on Computational Geometry, Minneapolis, MN, pp. 86–95 (1998)

    Google Scholar 

  36. Ansel Teng, Y., Sullivan, F., Beichl, I., Puppo, E.: A data-parallel algorithm for three-dimensional delaunay triangulation and its implementation. In: ACM Conference on Supercomputing, pp. 112–121. ACM, New York (1993)

    Chapter  Google Scholar 

  37. Watson, D.F.: Computing the n-dimensional Delaunay tesselation with application to Voronoi polytopes. Computer Journal 24, 167–172 (1981)

    Article  MathSciNet  Google Scholar 

  38. Zhang, Y., Hughes, T.J.R., Bajaj, C.L.: An automatic 3d mesh generation method for domains with multiple materials. Computer Methods in Applied Mechanics and Engineering 199(5-8), 405–415 (2010); Computational Geometry and Analysis

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, College of William and Mary, US

    Panagiotis Foteinos

  2. Department of Computer Science, Old Dominion University, US

    Panagiotis Foteinos & Nikos Chrisochoides

Authors
  1. Panagiotis Foteinos
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nikos Chrisochoides
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Sandia National Laboratories, P.O. Box 5800, 87185, Albuquerque, NM, USA

    William Roshan Quadros

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Foteinos, P., Chrisochoides, N. (2011). Dynamic Parallel 3D Delaunay Triangulation. In: Quadros, W.R. (eds) Proceedings of the 20th International Meshing Roundtable. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24734-7_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-24734-7_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-24733-0

  • Online ISBN: 978-3-642-24734-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation