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.
Type de document :
Article dans une revue
International Journal of Computational Geometry and Applications, World Scientific Publishing, 2003, 13, pp.231-240. 〈10.1142/S021819590300113X〉
Liste complète des métadonnées

Littérature citée [6 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00412608
Contributeur : Olivier Devillers <>
Soumis le : mercredi 2 septembre 2009 - 11:45:20
Dernière modification le : mercredi 7 mars 2018 - 10:21:20
Document(s) archivé(s) le : mardi 15 juin 2010 - 21:18:44

Fichier

ijcga.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

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〉

Partager

Métriques

Consultations de la notice

233

Téléchargements de fichiers

170