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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [6 references]  Display  Hide  Download

https://hal.inria.fr/inria-00412608
Contributor : Olivier Devillers <>
Submitted on : Wednesday, September 2, 2009 - 11:45:20 AM
Last modification on : Wednesday, March 7, 2018 - 10:21:20 AM
Long-term archiving on : Tuesday, June 15, 2010 - 9:18:44 PM

File

ijcga.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Olivier Devillers, Franco Preparata. Culling a Set of Points for Roundness or Cylindricity Evaluations. International Journal of Computational Geometry and Applications, World Scientific Publishing, 2003, 13, pp.231-240. ⟨10.1142/S021819590300113X⟩. ⟨inria-00412608⟩

Share

Metrics

Record views

283

Files downloads

252