Culling a Set of Points for Roundness or Cylindricity Evaluations - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles International Journal of Computational Geometry and Applications Year : 2003

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.
Fichier principal
Vignette du fichier
ijcga.pdf (136.77 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00412608 , version 1 (02-09-2009)

Identifiers

Cite

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

Altmetric

Share

Gmail Facebook Twitter LinkedIn More