Abstract
Tetrahedralization algorithms are used for many applications such as Ray Tracing and Finite Element Methods. For most of the applications, constrained tetrahedralization algorithms are chosen because they can preserve input triangles. The constrained tetrahedralization algorithms developed so far might suffer from a lack of memory. We propose an out-of-core near Delaunay constrained tetrahedralization algorithm using the divide-and-conquer paradigm to decrease memory usage. If the expected memory usage is below the user-defined memory limit, we tetrahedralize using TetGen. Otherwise, we subdivide the set of input points into two halves and recursively apply the same idea to the two halves. When compared with the TetGen, our algorithm tetrahedralizes the point clouds using less amount of memory but takes more time and generates tetrahedralizations that do not satisfy the Delaunay criterion at the boundaries of the merged regions. We quantify the error using the aspect-ratio metric. The difference between the tetrahedralizations that our approach produce and the Delaunay tetrahedralization are small and the results are acceptable for most applications.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Blelloch, G.E., Miller, G.L., Talmor, D.: Developing a practical projection-based parallel Delaunay algorithm. In: Proceedings of the 12th Annual Symposium on Computational Geometry, SCG ’96, pp. 186–195. ACM, New York (1996)
Chew, L.P.: Constrained Delaunay triangulations. Algorithmica 4(1–4), 97–108 (1989)
Cignoni, P., Montani, C., Scopigno, R.: DeWall: a fast divide and conquer Delaunay triangulation algorithm in Ed. Comput.-Aided Des. 30(5), 333–341 (1998)
Lagae, A., Dutré, P.: Accelerating ray tracing using constrained tetrahedralizations. Comput. Graph. Forum 27(4), 1303–1312 (2008)
Si, H.: TetGen, a Delaunay-based quality tetrahedral mesh generator. ACM Trans. Math. Softw. 41(2), 1–36 (2015)
Smolik, M., Skala, V.: Fast parallel triangulation algorithm of large data sets in E2 and E3 for in-core and out-core memory processing. In: Proceedings of the International Conference on Computational Science and Its Applications, ICCSA ’14, pp. 301–314. Springer, Berlin (2014)
The CGAL Project: CGAL User and Reference Manual, 5.0.2 edn. (2020). https://doc.cgal.org/5.0.2/Manual/packages.html
Woop, S., Schmittler, J., Slusallek, P.: RPU: a programmable ray processing unit for realtime ray tracing. ACM Trans. Graph. 24(3), 434–444 (2005)
Acknowledgements
This research is supported by The Scientific and Technological Research Council of Turkey (TÜBİTAK) under Grant No. 117E881.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Erkoç, Z., Aman, A., Güdükbay, U., Si, H. (2021). Out-of-core Constrained Delaunay Tetrahedralizations for Large Scenes. In: Garanzha, V.A., Kamenski, L., Si, H. (eds) Numerical Geometry, Grid Generation and Scientific Computing. Lecture Notes in Computational Science and Engineering, vol 143. Springer, Cham. https://doi.org/10.1007/978-3-030-76798-3_7
Download citation
DOI: https://doi.org/10.1007/978-3-030-76798-3_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-76797-6
Online ISBN: 978-3-030-76798-3
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)