Please use this identifier to cite or link to this item:
|Title:||Generation of polyhedral models from machine vision data||Authors:||Bradley, C.
|Issue Date:||1999||Citation:||Bradley, C.,Wei, S.,Zhang, Y.F.,Loh, H.T. (1999). Generation of polyhedral models from machine vision data. Proceedings of SPIE - The International Society for Optical Engineering 3832 : 26-37. ScholarBank@NUS Repository.||Abstract:||An algorithm suitable for triangulating three-dimensional (3D) data points, produced by a machine vision system or coordinate measuring machine (CMM), is described. The algorithm is suitable for processing the data collected from objects composed of free form surface patches. The data is produced by a 3D machine vision system integrated into a computer numerically controlled CMM. The software can model very large 3D data sets, termed cloud data, using a unified, non-redundant triangular mesh. This is accomplished from the 3D data points in two steps. Firstly, an initial data thinning is performed, to reduce the copious data set size, employing 3D spatial filtering. Secondly, the triangulation commences, utilizing a set of heuristic rules, from a user defined seed point. The triangulation algorithm interrogates the local geometric and topological information inherent in the cloud data points. The spatial filtering parameters are extracted from the data set, by a series of local surface patches, and the required spatial error between the final triangulation and the cloud data. Case studies are presented that illustrate the efficacy of the technique for rapidly constructing a geometric model from 3D digitized data.||Source Title:||Proceedings of SPIE - The International Society for Optical Engineering||URI:||http://scholarbank.nus.edu.sg/handle/10635/75007||ISSN:||0277786X|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Oct 27, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.