Distance Based Feature Detection on 3D Point Sets
Abstract
We propose a distance based algorithm for implicit feature detection on 3D point sets. Instead of directly determining whether a point belongs to a feature of the 3D point set or not, we first compute the distance between the point and its nearest feature. The obtained distance function is filtered, removing noise and outliers, and the features of the point set are computed as the zero set of the filtered function. Initial tests show that the proposed method is robust and can deal with amount of noise usually expected in a point set.
BibTeX
@inproceedings {10.2312:LocalChapterEvents:TPCG:TPCG09:053-056,
booktitle = {Theory and Practice of Computer Graphics},
editor = {Wen Tang and John Collomosse},
title = {{Distance Based Feature Detection on 3D Point Sets}},
author = {Ramli, Ahmad and Ivrissimtzis, Ioannis},
year = {2009},
publisher = {The Eurographics Association},
ISBN = {978-3-905673-71-5},
DOI = {10.2312/LocalChapterEvents/TPCG/TPCG09/053-056}
}
booktitle = {Theory and Practice of Computer Graphics},
editor = {Wen Tang and John Collomosse},
title = {{Distance Based Feature Detection on 3D Point Sets}},
author = {Ramli, Ahmad and Ivrissimtzis, Ioannis},
year = {2009},
publisher = {The Eurographics Association},
ISBN = {978-3-905673-71-5},
DOI = {10.2312/LocalChapterEvents/TPCG/TPCG09/053-056}
}