Skip to main content

Preprocessing Convex Polygons Using Range Trees for Recognition with Few Finger Probes

  • Conference paper
Computer Analysis of Images and Patterns (CAIP 2005)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 3691))

Included in the following conference series:

  • 1130 Accesses

Abstract

The problem considered is that of recognizing if a given convex polygon comes from a known collection by applying probes. Existing approaches use a number of probes that is linear in the number of sides of the polygon. The current premise is that probing is expensive, while computing is cheap. Accordingly, a method is proposed that recognizes a polygon from the collection, with high probability, using only a constant number of probes, at the cost of fairly large computing resources, particularly, in setting up and applying a range tree data structure.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Belleville, P., Shermer, T.C.: Probing Polygons Minimally is Hard. Computational Geometry: Theory and Applications 2, 255–265 (1993)

    MATH  MathSciNet  Google Scholar 

  2. Bernstein, H.J.: Determining the Shape of a Convex n-sided Polygon using 2n + k Tactile Probes. Information Processing Letters 22, 255–260 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  3. CGAL, Computational Geometry Algorithms Library, http://www.cgal.org

  4. Cole, R., Yap, C.K.: Shape from Probing. Journal of Algorithms 8, 19–38 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  5. de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications, 2nd edn. Springer, Heidelberg (2000)

    MATH  Google Scholar 

  6. Dobkin, D.P., Edelsbrunner, H., Yap, C.K.: Probing Convex Polytopes. In: Proc. 18th ACM Symposium on the Theory of Computing, pp. 424–432 (1988)

    Google Scholar 

  7. Eves, H.W.: A Survey of Geometry, Revised Edn. Allyn and Bacon (1965)

    Google Scholar 

  8. Joseph, E., Skiena, S.S.: Model-Based Probing Strategies for Convex Polygons. Computational Geometry: Theory and Applications 2, 209–221 (1992)

    MATH  MathSciNet  Google Scholar 

  9. Levy, S.D.: KDTree - A Java class for KD-tree search (exact and nearest-neighbor), http://www.cs.wlu.edu/~levy

  10. Romanik, K.: Geometric Probing and Testing - A Survey, DIMACS Technical Report 95-42 (1995)

    Google Scholar 

  11. Skiena, S.S.: Geometric Probing, Ph.D. Thesis, Dept. of Computer Science. University of Illinois at Urbana-Champaign (1998)

    Google Scholar 

  12. Skiena, S.S.: Interactive Reconstruction via Geometric Probing. In: Proceedings of the IEEE, vol. 80, pp. 1364–1383 (1992)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Guha, S., Khánh, K.T. (2005). Preprocessing Convex Polygons Using Range Trees for Recognition with Few Finger Probes. In: Gagalowicz, A., Philips, W. (eds) Computer Analysis of Images and Patterns. CAIP 2005. Lecture Notes in Computer Science, vol 3691. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11556121_42

Download citation

  • DOI: https://doi.org/10.1007/11556121_42

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28969-2

  • Online ISBN: 978-3-540-32011-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics