Article

Learning smooth objects by probing

Authors:

Jean-Daniel Boissonnat,

Leonidas J. Guibas,

Steve OudotAuthors Info & Claims

SCG '05: Proceedings of the twenty-first annual symposium on Computational geometry

Pages 198 - 207

https://doi.org/10.1145/1064092.1064124

Published: 06 June 2005 Publication History

Abstract

We consider the problem of discovering a smooth unknown surface S bounding an object O in R³. The discovery process consists of moving a point probing device in the free space around O so that it repeatedly comes in contact with S. We propose a probing strategy for generating a sequence of surface samples on S from which a triangulated surface can be generated which approximates S within any desired accuracy. We bound the number of probes and the number of elementary moves of the probing device. Our solution is an extension of previous work on Delaunay refinement techniques for surface meshing. The approximating surface we generate enjoys the many nice properties of the meshes obtained by those techniques, e.g. exact topological type, normal approximation, etc.

References

[1]

Panagiotis D. Alevizos, Jean-Daniel Boissonnat, and Mariette Yvinec. Non-convex contour reconstruction.J. Symbolic Comput., 10:225--252, 1990.

Digital Library

[2]

N. Amenta, S. Choi, T. K. Dey, and N. Leekha. A simple algorithm for homeomorphic surface reconstruction. In Proc. 16th Annu. ACM Sympos. Comput. Geom., pages 213--222, 2000.

Digital Library

[3]

Nina Amenta and Marshall Bern. Surface reconstruction by Voronoi filtering. Discrete Comput. Geom., 22(4):481--504, 1999.

[4]

Dominique Attali, Jean-Daniel Boissonnat, and Andre Lieutier. Complexity of the Delaunay triangulation of points on surfaces: the smooth case. In Proc. 19th Annu. ACM Sympos. Comput. Geom., pages 201--210, 2003.

Digital Library

[5]

Jean-Daniel Boissonnat and Steve Oudot. Provably good sampling and meshing of surfaces. Graphical Models (special issue on Solid Modeling), 2005. To appear.

Digital Library

[6]

Jean-Daniel Boissonnat and Mariette Yvinec. Probing a scene of non-convex polyhedra. Algorithmica, 8:321--342, 1992.

Digital Library

[7]

M. Do Carmo. Riemannian Geometry. Birkhäuser, Boston, Basel, Berlin, 1992.

[8]

L. P. Chew. Guaranteed-quality mesh generation for curved surfaces. In Proc. 9th Annu. ACM Sympos. Comput. Geom., pages 274--280, 1993.

Digital Library

[9]

R. Cole and C. K. Yap. Shape from probing. J. Algorithms, 8(1):19--38, March 1987.

Digital Library

[10]

T. K. Dey and S. Goswami. Provable surface reconstruction from noisy samples. In Proc. 20th Annu. ACM Sympos. Comput. Geom., pages 330--339, 2004.

Digital Library

[11]

D. P. Dobkin, H. Edelsbrunner, and C. K. Yap. Probing convex polytopes. In Proc. 18th Annu. ACM Sympos. Theory Comput., pages 424--432, 1986.

Digital Library

[12]

H. Federer. Geometric Measure Theory. Springer-Verlag, 1970.

[13]

P. M. Gruber. Approximation of convex bodies. In Peter M. Gruber and J. M. Wills, editors, Convexity and its Applications, pages 131--162. Birkhauser, Basel, Switzerland, 1983.

[14]

M. Lindenbaum and A. M. Bruckstein. Blind approximation of planar convex sets. IEEE Trans. Robot. Autom., 10(4):517--529, August 1994.

[15]

W. Lorensen and H. Cline. Marching cubes: a high resolution 3d surface construction algorithm. Comput. Graph., 21(4):163--170, 1987.

Digital Library

[16]

T. J. Richardson. Approximation of planar convex sets from hyperplanes probes. Discrete and Computational Geometry, 18:151--177, 1997.

[17]

Günter Rote. The convergence rate of the Sandwich algorithm for approximating convex functions. Computing, 48:337--361, 1992.

Digital Library

[18]

Steven S. Skiena. Geometric reconstruction problems. In Jacob E. Goodman and Joseph O'Rourke, editors, Handbook of Discrete and Computational Geometry, chapter 26, pages 481--490. CRC Press LLC, Boca Raton, FL, 1997.

Digital Library

[19]

J. F. Traub, G. W. Wasilkowski, and H. Wozniakowski. Information-based Complexity. Academic Press, 1988.

Digital Library

[20]

J. F. Traub and A. G. Werschulz. Complexity and Information. Cambridge University Press, 1998.

Digital Library

Cited By

Song DKim Y(2019)Distortion-free Robotic Surface-drawing using Conformal Mapping2019 International Conference on Robotics and Automation (ICRA)10.1109/ICRA.2019.8794034(627-633)Online publication date: May-2019
https://doi.org/10.1109/ICRA.2019.8794034
Dyer RZhang HMöller TBelyaev AGarland M(2007)Delaunay mesh constructionProceedings of the fifth Eurographics symposium on Geometry processing10.5555/1281991.1282027(273-282)Online publication date: 4-Jul-2007
https://dl.acm.org/doi/10.5555/1281991.1282027
Boissonnat JGuibas LOudot S(2007)Learning smooth shapes by probingComputational Geometry: Theory and Applications10.1016/j.comgeo.2006.05.00837:1(38-58)Online publication date: 1-May-2007
https://dl.acm.org/doi/10.1016/j.comgeo.2006.05.008
Show More Cited By

Index Terms

Learning smooth objects by probing
1. Computing methodologies
  1. Computer graphics
    1. Shape modeling
      1. Parametric curve and surface models
      2. Volumetric models

Recommendations

Learning smooth shapes by probing

We consider the problem of discovering a smooth unknown surface S bounding an object O in R^3. The discovery process consists of moving a point probing device in the free space around O so that it repeatedly comes in contact with S. We propose a probing ...
Learning smooth objects by probing
SCG '05: Proceedings of the twenty-first annual symposium on Computational geometry

This video considers the problem of discovering the boundary S of an unknown smooth object O. The discovery process consists of moving a point probing device in the free space around O so that it repeatedly comes in contact with S. We present a probing ...
Localized delaunay refinement for piecewise-smooth complexes
SoCG '13: Proceedings of the twenty-ninth annual symposium on Computational geometry

Delaunay refinement, a versatile method of mesh generation, is plagued by memory thrashing when required to generate large output meshes. To address this space issue, a localized version of Delaunay refinement was proposed for generating meshes for ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SCG '05: Proceedings of the twenty-first annual symposium on Computational geometry

June 2005

398 pages

ISBN:1581139918

DOI:10.1145/1064092

Program Chairs:
Joe Mitchell
SUNY Stony Brook
,
Günter Rote
Freie Universität Berlin

Copyright © 2005 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]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 06 June 2005

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

SoCG05

Sponsor:

SoCG05: The 21st Annual ACM Symposium on Computational Geometry 2005

June 6 - 8, 2005

Pisa, Italy

Acceptance Rates

SCG '05 Paper Acceptance Rate 41 of 141 submissions, 29%;

Overall Acceptance Rate 625 of 1,685 submissions, 37%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
239
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 22 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Song DKim Y(2019)Distortion-free Robotic Surface-drawing using Conformal Mapping2019 International Conference on Robotics and Automation (ICRA)10.1109/ICRA.2019.8794034(627-633)Online publication date: May-2019
https://doi.org/10.1109/ICRA.2019.8794034
Dyer RZhang HMöller TBelyaev AGarland M(2007)Delaunay mesh constructionProceedings of the fifth Eurographics symposium on Geometry processing10.5555/1281991.1282027(273-282)Online publication date: 4-Jul-2007
https://dl.acm.org/doi/10.5555/1281991.1282027
Boissonnat JGuibas LOudot S(2007)Learning smooth shapes by probingComputational Geometry: Theory and Applications10.1016/j.comgeo.2006.05.00837:1(38-58)Online publication date: 1-May-2007
https://dl.acm.org/doi/10.1016/j.comgeo.2006.05.008
Boissonnat JOudot SAmenta NCheong O(2006)Provably good sampling and meshing of Lipschitz surfacesProceedings of the twenty-second annual symposium on Computational geometry10.1145/1137856.1137906(337-346)Online publication date: 5-Jun-2006
https://dl.acm.org/doi/10.1145/1137856.1137906
Boissonnat JGuibas LOudot SMitchell JRote G(2005)Learning smooth objects by probingProceedings of the twenty-first annual symposium on Computational geometry10.1145/1064092.1064148(364-365)Online publication date: 6-Jun-2005
https://dl.acm.org/doi/10.1145/1064092.1064148

View Options

Login options

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

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents