Learning smooth objects by probing

Authors:
Jean-Daniel Boissonnat;Leonidas J. Guibas;Steve Oudot
Affiliations:
INRIA, Sophia-Antipolis;Stanford University, Stanford, CA;INRIA, Sophia-Antipolis
Venue:
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Year:
2005

Citing 5
Cited 0

Shape from probing

Journal of Algorithms
Non-convex contour reconstruction

Journal of Symbolic Computation
The convergence rate of the sandwich algorithm for approximating convex functions

Computing
Geometric reconstruction problems

Handbook of discrete and computational geometry
Learning smooth objects by probing

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 strategy for generating a sequence of sample points of S, from which a PL-approximation of S can be constructed, within any desired accuracy. This strategy can be applied in any dimension, although its output is guaranteed only for objects embedded in the plane or in 3-space. For pedagogical purpose, the video focuses on the planar case.