A GPU-based Method for Generating quasi-Delaunay Triangulations based on Edge-flips

Cristobal A. Navarro, Eliana Scheihing, Nancy Hitschfeld-Kahler

Abstract

The Delaunay edge-flip technique is a practical method for transforming any existing triangular mesh S into a mesh T(S) that satisfies the Delaunay condition. In this paper we present an iterative GPU-based method capable of improving triangulations under the Delaunay criteria. This method is based on the edge-flip technique and its implementation is fully integrable with the OpenGL rendering pipeline. Since the algorithm uses an e value to handle co-circular or close to co-circular point configurations, we can not guarantee that all triangles fulfill the Delaunay condition. However, we have compared the triangulations generated by our method with the ones generated by the Triangle software and by the CGAL library and we obtained less than 0.05% different triangles. Based on our experimental results, we report speedups from 14× to 50× against Lawson’s sequential algorithm and of approximately 3× against the O(nlog n) CGAL’s and Triangle’s constructive algorithms while processing bad quality triangulations.

References

  1. Antonopoulos, C. D., Ding, X., Chernikov, A., Blagojevic, F., Nikolopoulos, D. S., and Chrisochoides, N. (2005). Multigrain parallel Delaunay mesh generation: challenges and opportunities for multithreaded architectures. In Proceedings of the 19th annual international conference on Supercomputing, ICS 7805, pages 367- 376, New York, NY, USA. ACM.
  2. Cao, T. T. (2010). Computing 2d Delaunay triangulation using GPU. Manuscript in preparation.
  3. CervenanskÉ, M., T óth, Z., StarinskÉ, J., Ferko, A., and Srámek, M. (2010). Parallel GPU-based datadependent triangulations. Computers & Graphics, 34(2):125-135.
  4. De Berg, M. (2000). Computational Geometry: Algorithms and Applications. Springer-Verlag TELOS, Santa Clara, CA, USA.
  5. Edelsbrunner, H. (2001). Geometry and topology for mesh generation (Cambridge monographs on applied and computational mathematics).
  6. Fortune, S. (1993). A note on Delaunay diagonal flips”. Pattern Recognition Letters, 14(9):723 - 726.
  7. Harada, T. (2011). A parallel constraint solver for a rigid body simulation. In SIGGRAPH Asia 2011 Sketches, SA 7811, pages 22:1-22:2, New York, NY, USA. ACM.
  8. Healey, R. G., Minetar, M. J., and Dowers, S., editors (1997). Parallel Processing Algorithms for GIS. Taylor & Francis, Inc., Bristol, PA, USA.
  9. Kohout, J. and Kolingerová, I. (2003). Parallel Delaunay triangulation based on circum-circle criterion. In SCCG 7803: Proceedings of the 19th spring conference on Computer graphics, pages 73-81, New York, NY, USA. ACM.
  10. Lawson, C. L. (1972). Transforming triangulations. Discrete Mathematics, 3(4):365 - 372.
  11. Navarro, C., Hitschfeld-Kahler, N., and Scheihing, E. (2011). A parallel GPU-based algorithm for Delaunay edge-flips. In Abstracts from 27th European Workshop on Computational Geometry (EUROCG2011), pages 75-78. Morschach, Switzerland.
  12. Nvidia (2011). NVIDIA CUDA Compute Unified Device Architecture - Programming Guide.
  13. Paul Chew, L. (1989). Constrained Delaunay triangulations. Algorithmica, 4:97-108.
  14. Rong, G., Tan, T.-S., Cao, T.-T., and Stephanus (2008). Computing two-dimensional Delaunay triangulation using graphics hardware. In I3D 7808: Proceedings of the 2008 symposium on Interactive 3D graphics and games, pages 89-97, New York, NY, USA. ACM.
  15. Shewchuk, J. R. (1996). Triangle: Engineering a 2d quality mesh generator and Delaunay triangulator. In ACM, editor, First Workshop on Applied Computational Geometry, pages 124-133. (Philadelphia, Pennsylvania).
  16. CGAL (2012). CGAL, Computational Geometry Algorithms Library. http://www.cgal.org.
  17. Tobler, R. F. and Maierhofer, S. (2006). A mesh data structure for rendering and subdivision. In WSCG 782006: Proceedings of WSCG (International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision), pages 157-162.
Download


Paper Citation


in Harvard Style

Navarro C., Hitschfeld-Kahler N. and Scheihing E. (2013). A GPU-based Method for Generating quasi-Delaunay Triangulations based on Edge-flips . In Proceedings of the International Conference on Computer Graphics Theory and Applications and International Conference on Information Visualization Theory and Applications - Volume 1: GRAPP, (VISIGRAPP 2013) ISBN 978-989-8565-46-4, pages 27-34. DOI: 10.5220/0004281900270034


in Bibtex Style

@conference{grapp13,
author={Cristobal A. Navarro and Nancy Hitschfeld-Kahler and Eliana Scheihing},
title={A GPU-based Method for Generating quasi-Delaunay Triangulations based on Edge-flips},
booktitle={Proceedings of the International Conference on Computer Graphics Theory and Applications and International Conference on Information Visualization Theory and Applications - Volume 1: GRAPP, (VISIGRAPP 2013)},
year={2013},
pages={27-34},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004281900270034},
isbn={978-989-8565-46-4},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Computer Graphics Theory and Applications and International Conference on Information Visualization Theory and Applications - Volume 1: GRAPP, (VISIGRAPP 2013)
TI - A GPU-based Method for Generating quasi-Delaunay Triangulations based on Edge-flips
SN - 978-989-8565-46-4
AU - Navarro C.
AU - Hitschfeld-Kahler N.
AU - Scheihing E.
PY - 2013
SP - 27
EP - 34
DO - 10.5220/0004281900270034