Abstract
This work is motivated by the need for software computing 3D periodic triangulations in numerous domains including astronomy, material engineering, biomedical computing, fluid dynamics etc. We design an algorithmic test to check whether a partition of the 3D flat torus into tetrahedra forms a triangulation (which subsumes that it is a simplicial complex). We propose an incremental algorithm that computes the Delaunay triangulation of a set of points in the 3D flat torus without duplicating any point, whenever possible; our algorithmic test detects when such a duplication can be avoided, which is usually possible in practical situations. Even in cases where point duplication is necessary, our algorithm always computes a triangulation that is homeomorpic to the flat torus. To the best of our knowledge, this is the first algorithm of this kind whose output is provably correct. The implementation will be released in Cgal[7].
This work was partially supported by the ANR (Agence Nationale de la Recherche) under the “Triangles” project of the Programme blanc (No BLAN07-2_194137) http://www-sop.inria.fr/geometrica/collaborations/triangles/ .
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aanjaneya, M., Teillaud, M.: Triangulating the real projective plane. In: Mathematical Aspects of Computer and Information Sciences (2007)
Armstrong, M.A.: Basic Topology. Springer, Heidelberg (1982)
Bowyer, A.: Computing Dirichlet tessellations. The Computer Journal 24, 162–166 (1981)
Caroli, M., Kruithof, N., Teillaud, M.: Decoupling the CGAL 3D triangulations from the underlying space. In: Workshop on Algorithm Engineering and Experiments, pp. 101–108 (2008)
Caroli, M., Teillaud, M.: Video: On the computation of 3D periodic triangulations. In: Proceedings of the twenty-fourth Annual Symposium on Computational Geometry, pp. 222–223 (2008)
Caroli, M., Teillaud, M.: Computing 3D periodic triangulations. Research Report 6823, INRIA (2009), http://hal.inria.fr/inria-00356871
Cgal, Computational Geometry Algorithms Library, http://www.cgal.org
Cheng, S.-W., Dey, T.K., Levine, J.A.: A practical Delaunay meshing algorithm for a large class of domains. In: Proceedings of the sixteenth International Meshing Roundtable, pp. 477–494 (2007)
Daverman, R.J., Sher, R.B. (eds.): Handbook of Geometric Topology. Elsevier, Amsterdam (2002)
de Fabritiis, G., Coveney, P.V.: Dynamical geometry for multiscale dissipative particle dynamics (2003), http://xxx.lanl.gov/abs/cond-mat/0301378v1
Delage, C.: Spatial sorting. In: CGAL editorial Board (eds.) CGAL User and Reference Manual, 3.4 edn. (2008)
Devillers, O.: The Delaunay hierarchy. International Journal of Foundations of Computer Science 13, 163–180 (2002)
Devillers, O., Teillaud, M.: Perturbations and vertex removal in a 3D Delaunay triangulation. In: Proceedings of the fourteenth ACM-SIAM Symposium on Discrete Algorithms, pp. 313–319 (2003)
Dolbilin, N.P., Huson, D.H.: Periodic Delone tilings. Periodica Mathematica Hungarica 34(1-2), 57–64 (1997)
Campayo, D.D.: Sklogwiki - Boundary conditions, http://www.sklogwiki.org/SklogWiki/index.php/Boundary_conditions
Graham, R.L., Grötschel, M., Lovász, L. (eds.): Handbook of Combinatorics. Elsevier, Amsterdam (1995)
Grima, C.I., Márquez, A.: Computational Geometry on Surfaces. Kluwer Academic Publishers, Dordrecht (2001)
Hatcher, A.: Algebraic Topology. Cambridge University Press, Cambridge (2002)
Held, M.: Vroni: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments. Computational Geometry: Theory and Applications 18, 95–123 (2001)
Henle, M.: A Combinatorial Introduction to Topology. Dover publication, New York (1979)
Hert, S., Seel, M.: dD convex hulls and Delaunay triangulations. In: CGAL Editorial Board (eds.) CGAL User and Reference Manual, 3.4 edn. (2008)
Lee, J.M.: Introduction to Topological Manifolds. Springer, New York (2000)
Mazón, M., Recio, T.: Voronoi diagrams on orbifolds. Computational Geometry: Theory and Applications 8, 219–230 (1997)
Pion, S., Teillaud, M.: 3D triangulation data structure. In: CGAL Editorial Board (eds.), CGAL User and Reference Manual. 3.4 edn. (2008)
Pion, S., Teillaud, M.: 3D triangulations. In: CGAL Editorial Board (eds.) CGAL User and Reference Manual, 3.4 edn. (2008)
Qhull, http://www.qhull.org
Rineau, L., Yvinec, M.: Meshing 3D domains bounded by piecewise smooth surfaces. In: Proceedings of the sixteenth International Meshing Roundtable, pp. 443–460 (2007)
Rineau, L., Yvinec, M.: 3D surface mesh generation. In: CGAL Editorial Board (eds.) CGAL User and Reference Manual, 3.4 edn. (2008)
Robins, V.: Betti number signatures of homogeneous Poisson point processes. Physical Review E 74(061107) (2006)
Rote, G., Vegter, G.: Computational topology: An introduction. In: Boissonnat, J.-D., Teillaud, M. (eds.) Effective Computational Geometry for Curves and Surfaces. Mathematics and Visualization, pp. 277–312. Springer, Heidelberg (2006)
Shewchuk, J.R.: Triangle: Engineering a 2d quality mesh generator and Delaunay triangulator. In: First Workshop on Applied Computational Geometry, May 1996. Association for Computing Machinery (1996)
Shewchuk, J.R.: Tetrahedral mesh generation by Delaunay refinement. In: Proceedings of the fourteenth Annual Symposium on Computational Geometry, pp. 86–95. ACM Press, New York (1998)
Spanier, E.H.: Algebraic Topology. Springer, New York (1966)
Thompson, K.E.: Fast and robust Delaunay tessellation in periodic domains. International Journal for Numerical Methods in Engineering 55, 1345–1366 (2002)
Thurston, W.P.: Three-Dimensional Geometry and Topology. Princeton University Press, Princeton (1997)
Weiss, D.: How hydrophobic Buckminsterfullerene affects surrounding water structure. INRIA Geometrica Seminar (March 2008), http://www-sop.inria.fr/geometrica
Wilson, P.M.H.: Curved Spaces. Cambridge University Press, Cambridge (2008)
Yvinec, M.: 2D triangulations. In: CGAL Editorial Board (eds), CGAL User and Reference Manual. 3.4 edn. (2008)
Zomorodian, A.: Topology for Computing. Cambridge University Press, Cambridge (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Caroli, M., Teillaud, M. (2009). Computing 3D Periodic Triangulations. In: Fiat, A., Sanders, P. (eds) Algorithms - ESA 2009. ESA 2009. Lecture Notes in Computer Science, vol 5757. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04128-0_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-04128-0_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04127-3
Online ISBN: 978-3-642-04128-0
eBook Packages: Computer ScienceComputer Science (R0)