An efficient proximity probing algorithm for metrology
An efficient proximity probing algorithm for metrology
复制标题
一种高效的计量邻近探测算法
DOI：
10.1109/coase.2013.6653995
复制
发表时间：
2013
期刊：
影响因子：
--
通讯作者：
Ken Goldberg
中科院分区：
文献类型：
--
作者：
S. Panahi;Aviv Adler;A.F. van der Stappen;Ken Goldberg
计量学，测量的理论和实践研究，在自动化制造，检测，机器人，测量和医疗保健中有应用。计量学中的一个重要问题是如何交互地使用测量设备或探头来确定未知物体的一些几何特性;这个问题被称为几何探测。在本文中，我们研究了一种类型的接近探针，给定一个点，返回的距离的边界的对象的问题。我们考虑的情况下，该对象是一个凸多边形P在平面上，该算法的目标是最小化上界的测量所需的数量，以准确地确定P。我们展示了一个算法，其中有一个上界的3.5n + k + 2测量必要，其中n是顶点的数量和k ≤ 3是锐角的数量的P。此外，我们表明，我们的算法需要O（1）计算每个探针，因此O（n）的时间来确定P。
Metrology, the theoretical and practical study of measurement, has applications in automated manufacturing, inspection, robotics, surveying, and healthcare. An important problem within metrology is how to interactively use a measuring device, or probe, to determine some geometric property of an unknown object; this problem is known as geometric probing. In this paper, we study a type of proximity probe which, given a point, returns the distance to the boundary of the object in question. We consider the case where the object is a convex polygon P in the plane, and the goal of the algorithm is to minimize the upper bound on the number of measurements necessary to exactly determine P. We show an algorithm which has an upper bound of 3.5n + k + 2 measurements necessary, where n is the number of vertices and k ≤ 3 is the number of acute angles of P. Furthermore, we show that our algorithm requires O(1) computations per probe, and hence O(n) time to determine P.