skip to main content
10.1145/1137856.1137906acmconferencesArticle/Chapter ViewAbstractPublication PagessocgConference Proceedingsconference-collections
Article

Provably good sampling and meshing of Lipschitz surfaces

Published:05 June 2006Publication History

ABSTRACT

In the last decade, a great deal of work has been devoted to the elaboration of a sampling theory for smooth surfaces. The goal was to ensure a good reconstruction of a given surface S from a finite subset E of S. The sampling conditions proposed so far offer guarantees provided that E is sufficiently dense with respect to the local feature size of S, which can be true only if S is smooth since the local feature size vanishes at singular points.In this paper, we introduce a new measurable quantity, called the Lipschitz radius, which plays a role similar to that of the local feature size in the smooth setting, but which is well-defined and positive on a much larger class of shapes. Specifically, it characterizes the class of Lipschitz surfaces, which includes in particular all piecewise smooth surfaces such that the normal deviation is not too large around singular points.Our main result is that, if S is a Lipschitz surface and E is a sample of S such that any point of S is at distance less than a fraction of the Lipschitz radius of S, then we obtain similar guarantees as in the smooth setting. More precisely, we show that the Delaunay triangulation of E restricted to S is a 2-manifold isotopic to S lying at bounded Hausdorff distance from S, provided that its facets are not too skinny.We further extend this result to the case of loose samples. As an application, the Delaunay refinement algorithm we proved correct for smooth surfaces works as well and comes with similar guarantees when applied to Lipschitz surfaces.

References

  1. N. Amenta and M. Bern. Surface reconstruction by Voronoi filtering. Discrete Comput. Geom., 22(4):481--504, 1999.Google ScholarGoogle ScholarCross RefCross Ref
  2. N. Amenta, S. Choi, T. K. Dey, and N. Leekha. A simple algorithm for homeomorphic surface reconstruction. Internat. Journal of Comput. Geom. and Applications, 12:125--141, 2002.Google ScholarGoogle ScholarCross RefCross Ref
  3. M. Berger and B. Costiaux. Differential Geometry: Manifolds, Curves, and Surfaces, volume 115 of Graduate Texts in Mathematics Series. Springer, 1988. 474 pages.Google ScholarGoogle Scholar
  4. J.-D. Boissonnat, L. J. Guibas, and S. Oudot. Learning smooth objects by probing. In Proc. 21st Annu. ACM. Sympos. Comput. Geom., pages 198--207, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. J.-D. Boissonnat and S. Oudot. Provably good sampling and meshing of surfaces. Graphical Models, 67(5):405--451, September 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. F. Chazal, D. Cohen-Steiner, and A. Lieutier. A sampling theory for compacts in Euclidean space. In Proc. 22nd Annu. ACM Sympos. Comput. Geom., 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. F. Chazal and A. Lieutier. Weak feature size and persistent homology: Computing homology of solids in Rn from noisy data samples. Technical Report 378, Institut de Mathématiques de Bourgogne, 2004. Partially published in {9}.Google ScholarGoogle Scholar
  8. F. Chazal and A. Lieutier. The λ-medial axis. Graphical Models, 67(4):304--331, July 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. F. Chazal and A. Lieutier. Weak feature size and persistent homology: Computing homology of solids in Rn from noisy data samples. In Proc. 21st Annual ACM Symposium on Computational Geometry, pages 255--262, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. L. P. Chew. Guaranteed-quality mesh generation for curved surfaces. In Proc. 9th Annu. ACM Sympos. Comput. Geom., pages 274--280, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. F. H. Clarke. Optimization and Nonsmooth Analysis. Classics in applied mathematics. SIAM, 1990.Google ScholarGoogle Scholar
  12. D. Cohen-Steiner, H. Edelsbrunner, and J. Harer. Stability of persistence diagrams. In Proc. 21st Annual ACM Symposium on Computational Geometry, pages 263--271, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. T. K. Dey, G. Li, and T. Ray. Polygonal surface remeshing with {Delaunay refinement. In Proc. 14th Internat. Meshing Roundtable, 2005.Google ScholarGoogle ScholarCross RefCross Ref
  14. H. Federer. Geometric Measure Theory. Classics in Mathematics. Springer-Verlag, 1996. Reprint of the 1969 ed.Google ScholarGoogle Scholar
  15. M. W. Hirsch. Differential Topology. Springer-Verlag, New York, NY, 1976.Google ScholarGoogle Scholar
  16. A. Lieutier. Any open bounded subset of Rn has the same homotopy type as it medial axis. Computer-Aided Design, 36(11):1029--1046, September 2004.Google ScholarGoogle ScholarCross RefCross Ref
  17. J. Nečas. Les méthodes directes en théorie des équations elliptiques. Masson, 1967.Google ScholarGoogle Scholar
  18. S. Oudot. Sampling and Meshing Surfaces with Guarantees. Thèse de doctorat en sciences, ècole Polytechnique, Palaiseau, France, 2005. Preprint available at ftp://ftp-sop.inria.fr/geometrica/soudot/preprints/thesis.pdf.Google ScholarGoogle Scholar
  19. S. Oudot, L. Rineau, and M. Yvinec. Meshing volumes bounded by smooth surfaces. In Proc. 14th Internat. Meshing Roundtable, pages 203--219, 2005.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Provably good sampling and meshing of Lipschitz surfaces

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        SCG '06: Proceedings of the twenty-second annual symposium on Computational geometry
        June 2006
        500 pages
        ISBN:1595933409
        DOI:10.1145/1137856
        • Program Chairs:
        • Nina Amenta,
        • Otfried Cheong

        Copyright © 2006 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 5 June 2006

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • Article

        Acceptance Rates

        Overall Acceptance Rate625of1,685submissions,37%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader