Advertisement

Discrete & Computational Geometry

, Volume 59, Issue 1, pp 226–237 | Cite as

An Obstruction to Delaunay Triangulations in Riemannian Manifolds

  • Jean-Daniel Boissonnat
  • Ramsay DyerEmail author
  • Arijit Ghosh
  • Nikolay Martynchuk
Article

Abstract

Delaunay has shown that the Delaunay complex of a finite set of points \(P\) of Euclidean space \(\mathbb {R}^m\) triangulates the convex hull of \(P,\) provided that \(P\) satisfies a mild genericity property. Voronoi diagrams and Delaunay complexes can be defined for arbitrary Riemannian manifolds. However, Delaunay’s genericity assumption no longer guarantees that the Delaunay complex will yield a triangulation; stronger assumptions on \(P\) are required. A natural one is to assume that \(P\) is sufficiently dense. Although results in this direction have been claimed, we show that sample density alone is insufficient to ensure that the Delaunay complex triangulates a manifold of dimension greater than 2.

Keywords

Delaunay complex Triangulation Riemannian manifold 

Mathematics Subject Classification

57R05 (Primary) 54B15 53B20 (Secondary) 

Notes

Acknowledgements

We thank Gert Vegter for suggesting that we look for an obstruction that can exist at all scales. We also thank David Cohen-Steiner and Mathijs Wintraecken for illuminating discussions. This research has been partially supported by the 7th Framework Programme for Research of the European Commission, under FET-Open Grant Number 255827 (CGL Computational Geometry Learning). Partial support has also been provided by the Advanced Grant of the European Research Council GUDHI (Geometric Understanding in Higher Dimensions). Arijit Ghosh is supported by Ramanujan Fellowship Number SB/S2/RJN-064/2015. Part of this work was done when he was a researcher at the Max-Planck-Institute for Informatics, Germany supported by the IndoGerman Max Planck Center for Computer Science (IMPECS). Part of this work was also done while he was a Visiting Scientist at the Advanced Computing and Microelectronics Unit, Indian Statistical Institute, Kolkata, India.

References

  1. 1.
    Aurenhammer, F.: Power diagrams: properties, algorithms and applications. SIAM J. Comput. 16(1), 78–96 (1987)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Boissonnat, J.-D., Dyer, R., Ghosh, A.: The stability of Delaunay triangulations. Int. J. Comput. Geom. Appl. 23(4–5), 303–333 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Boissonnat, J.-D., Dyer, R., Ghosh, A.: Delaunay triangulation of manifolds. Found. Comput. Math. doi: 10.1007/s10208-017-9344-1 (2017)
  4. 4.
    Boissonnat, J.-D., Guibas, L.J., Oudot, S.Y.: Manifold reconstruction in arbitrary dimensions using witness complexes. Discret. Comput. Geom. 42(1), 37–70 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Boissonnat, J.-D., Nielsen, F., Nock, R.: Bregman Voronoi diagrams. Discret. Comput. Geom. 44(2), 281–307 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Cairns, S.S.: A simple triangulation method for smooth manifolds. Bull. Am. Math. Soc. 67(4), 389–390 (1961)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Canas, G.D., Gortler, S.J.: Duals of orphan-free anisotropic Voronoi diagrams are embedded meshes. In: Proceedings of the 28th Annual Symposium on Computational Geometry (SoCG’12), pp. 219–228. ACM, New York (2012)Google Scholar
  8. 8.
    Canas, G.D., Gortler, S.J.: On the embeddability of Delaunay triangulations in anisotropic, normed, and Bregman spaces. arXiv:1512.03589 (2015)
  9. 9.
    Chavel, I.: Riemannian Geometry: A Modern Introduction. Cambridge Studies in Advanced Mathematics, vol. 98, 2nd edn. Cambridge University Press, Cambridge (2006)Google Scholar
  10. 10.
    Cheng, S.-W., Dey, T.K., Ramos, E.A.: Manifold reconstruction from point samples. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’05), pp. 1018–1027. SIAM, Philadelphia (2005)Google Scholar
  11. 11.
    Clarkson, K.L.: Building triangulations using epsilon-nets. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC’06), pp. 326–335. ACM, New York (2006)Google Scholar
  12. 12.
    de Laat, D.: Approximating manifolds by meshes: asymptotic bounds in higher codimension. Master’s Thesis, University of Groningen, Groningen (2011)Google Scholar
  13. 13.
    Delaunay, B.: Sur la sphère vide. Bull. Acad. Sci. URSS Cl. Sci. Technol. 6, 793–800 (1934)zbMATHGoogle Scholar
  14. 14.
    Dyer, R., Zhang, H., Möller, T.: Surface sampling and the intrinsic Voronoi diagram. Comput. Graph. Forum 27(5), 1393–1402 (2008)CrossRefGoogle Scholar
  15. 15.
    Leibon, G.D.: Random Delaunay triangulations, the Thurston–Andreev theorem, and metric uniformization. PhD Thesis, University of California, San Diego (1999). arXiv:math/0011016v1
  16. 16.
    Leibon, G., Letscher, D.: Delaunay triangulations and Voronoi diagrams for Riemannian manifolds. In: Proceedings of the 16th Annual Symposium on Computational Geometry (SoCG’00), pp. 341–349. ACM, New York (2000)Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2017

Authors and Affiliations

  1. 1.Université Côte d’AzurInriaFrance
  2. 2.Collège de FranceParisFrance
  3. 3.ACM UnitIndian Statistical InstituteKolkataIndia
  4. 4.Johann Bernoulli Institute for Mathematics and Computer ScienceUniversity of GroningenGroningenThe Netherlands

Personalised recommendations