Probing Polygons Minimally Is Hard

  title={Probing Polygons Minimally Is Hard},
  author={Patrice Belleville and Thomas C. Shermer},
  journal={Comput. Geom.},
Belleville, P. and T.C. Shermer, Probing polygons minimally is hard, Computational Geometry: Theory and Applications 2 (1993) 255-265. Let r be a set of convex unimodal polygons in fixed position and orientation. We prove that the problem of determining whether k finger probes are sufficient to distinguish among the polygons in f is NP-complete for two types of finger probes. This implies that the same results hold for most interesting classes of polygons on which finger probes can be used. 
Highly Cited
This paper has 21 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.


Publications referenced by this paper.
Showing 1-7 of 7 references

Probing polygons minimally is hard

P. Belleville
in: Proceedings of the Third Canadian Conference in Computational Geometry • 1991
View 3 Excerpts
Highly Influenced

An efficient algorithm for identifying objects using robot probes

K. A. Lyons

Computational Geometry, an Introduction (Springer, Berlin, 1988, 2nd Ed.)

F. P. Preparata, M. I. Shamos

Geometric probing, Ph.D. Thesis, University of Illinois at Urbana-Champain

S. S. Skiena

Algorithms in Combinatorial Geometry

EATCS Monographs in Theoretical Computer Science • 1987

Similar Papers

Loading similar papers…