Probing polygons minimally is hard

10Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

Let Γ 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 Γ 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. © 1993.

Cite

CITATION STYLE

APA

Belleville, P., & Shermer, T. C. (1993). Probing polygons minimally is hard. Computational Geometry: Theory and Applications, 2(5), 255–265. https://doi.org/10.1016/0925-7721(93)90022-X

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free