Shape Segmentation and Matching from Noisy Point Clouds

Dey, Tamal K.; Giesen, Joachim; Goswami, Samrat

Shape Segmentation and Matching from Noisy Point Clouds

Files

193-199.pdf (1.48 MB)

Date

2004

Authors

Dey, Tamal K.
Giesen, Joachim
Goswami, Samrat

Publisher

The Eurographics Association

Abstract

We present the implementation results of a shape segmentation technique and an associated shape matching method whose input is a point sample from the shape. The sample is allowed to be noisy in the sense that they may scatter around the boundary of the shape instead of lying exactly on it. The algorithm is simple and mostly combinatorial in that it builds a single data structure, the Delaunay triangulation of the point set, and groups the tetrahedra to form the segments. A small set of weighted points are derived from the segments which are used as signatures to match shapes. Experimental results establish the effectiveness of the method in practice.

        @inproceedings{:10.2312/SPBG/SPBG04/193-199
,
booktitle = {SPBG'04 Symposium on Point - Based Graphics 2004
},
editor = {Markus Gross and Hanspeter Pfister and Marc Alexa and Szymon Rusinkiewicz
},
title = {{Shape Segmentation and Matching from Noisy Point Clouds
}},
author = {Dey, Tamal K. and 
Giesen, Joachim and 
Goswami, Samrat
},
year = {2004
},
publisher = {The Eurographics Association
},
ISSN = {1811-7813
},
ISBN = {3-905673-09-6
},
DOI = {/10.2312/SPBG/SPBG04/193-199
}
}