Skip to main content
SpringerLink
Log in

Reconstruction of polygonal sets by constrained and unconstrained double probing

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

Abstract

The problem of recovering the shape of planar objects arises in robotics. This work deals with this problem under the assumption that composite double probings are made. Two kinds of double probes are considered and their use for reconstructing convex planar polygons is investigated. For both kinds of probes, lower bounds on the number of probings required for reconstruction under any strategy are obtained and specific strategies which are proven to be almost optimal are provided.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

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

    Google Scholar 

  2. H. Bernstein, Determining the shape of a convexn-sided polygon by using 2n+k tactile probes, Inform. Process. Lett. 22 (1986) 255–260.

    Google Scholar 

  3. D.P. Dobkin, H. Edelsbrunner and C.K. Yap, Probing convex polytopes,Proc. 18th Annual ACM Symp. on Theory of Computing (1986) pp. 424–432.

  4. J.P. Greschak, Reconstructing convex sets, Ph.D. Dissertation, Dept. of Electrical Engineering and Computer Science, MIT (1985).

  5. M. Lindenbaum and A. Bruckstein, Reconstructing convex sets from support hyperplane measurements, EE Report No. 673, Technion, Haifa (1988).

    Google Scholar 

  6. S.Y.R. Li, Reconstructing polygons from projections, Inform. Process. Lett. 28 (1988) 235–240.

    Google Scholar 

  7. S.S. Skiena, Geometric probing, Doctoral Disseration, Department of Computer Science, University of Illinois at Urbana-Champaign (1988).

  8. H. Edelsbrunner and S.S. Skiena, Probing convex polygons with x-rays, SIAM J. Comput. 17 (1988) 870–882.

    Google Scholar 

  9. S.S. Skiena, Problems in geometric probing, Algorithmica (1989) 599–605.

  10. P.D. Alevizos, J.D. Boissonnat and M. Yvinec, Probing non convex polygons,Proc. IEEE Int. Conf. on Robotics and Automation, Phoenix (1989).

  11. M. Lindenbaum, Topics in geometric probing, Doctoral Dissertation, Department of Electrical Engineering, Technion (1990).

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering, Technion-Israel Institute of Technology, 32000, Haifa, Israel

    M. Lindenbaum

  2. Department of Computer Science, Technion-Israel Institute of Technology, 32000, Haifa, Israel

    A. Bruckstein

Authors
  1. M. Lindenbaum
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Bruckstein
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lindenbaum, M., Bruckstein, A. Reconstruction of polygonal sets by constrained and unconstrained double probing. Ann Math Artif Intell 4, 345–361 (1991). https://doi.org/10.1007/BF01531064

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01531064

Keywords

Search

Navigation