Dey, Tamal K.Giesen, JoachimGoswami, SamratMarkus Gross and Hanspeter Pfister and Marc Alexa and Szymon Rusinkiewicz2014-01-292014-01-2920043-905673-09-61811-7813https://doi.org/10.2312/SPBG/SPBG04/193-199We 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.Categories and Subject Descriptors (according to ACM CCS): I.3.3 [Computer Graphics]: Modeling3D Shape Matching, Point-Based Graphics.