Determining the shape of a convex n-sided polygon by using 2n + k tactile probes
Herbert Jacob Bernstein
Abstract
Herbert Jacob Bernstein
Abstract
We show that 2n + k tactile probes are sufficient to determine the shape of a convex polygon of n sides selected from a known finite set of polygons. This result improves on the 3n probe algorithm of Cole and Yap (1983) in the finite case. We show k = 3 under the assumptions of Cole and Yap, k = 2 under slightly stronger assumptions, and k = −1 under the assumptions of Schwartz and Sharir (1984).
OpenAlex reports 35 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We show that 2n + k tactile probes are sufficient to determine the shape of a convex polygon of n sides selected from a known finite set of polygons. This result improves on the 3n probe algorithm of Cole and Yap (1983) in the finite case. We show k = 3 under the assumptions of Cole and Yap, k = 2 under slightly stronger assumptions, and k = −1 under the assumptions of Schwartz and Sharir (1984).
Key concepts: Regular polygon, Polygon (computer graphics), Convex polygon, Combinatorics, Set (abstract data type), Mathematics, Convex set, Finite set