Culling a Set of Points for Roundness or Cylindricity Evaluations
Abstract
Roundness and cylindricity evaluations are among the most important problems in computational metrology, and are based on sets of surface measurements (input data points). A recent approach to such evaluations is based on a linear-programming approach yielding a rapidly converging solution. Such a solution is determined by a fixed-size subset of a large input set. With the intent to simplify the main computational task, it appears desirable to cull from the input any point that cannot provably define the solution. In this note we present an analysis and an efficient solution to the problem of culling the input set. For input data points arranged in cross-sections under mild conditions of uniformity, this algorithm runs in linear time.
This work was partially supported by the U.S. Army Research Office under grant DAAH04-96-1-0013. This work was done in part while O. Devillers was visiting Brown University.
| Remember to check out the Most Cited Articles! |
|---|
|
Check out these titles in image analysis! |
