Shape reasoning and understanding

s: clustering, denoising, sharp feature, shape abstraction, reverse engineering In this paper we describe a hierarchical face clustering algorithm for triangle meshes based on fitting primitives belonging to an arbitrary set. The method proposed is completely automatic, and generates a binary tree of clusters, each of which fitted by one of the primitives employed. Initially, each triangle represents a single cluster; at every iteration, all the pairs of adjacent clusters are considered, and the one that can be better approximated by one of the primitives forms a new single cluster. The approximation error is evaluated using the same metric for all the primitives, so that it makes sense to choose which is the most suitable primitive to approximate the set of triangles in a cluster. Based on this approach, we implemented a prototype which uses planes, spheres and cylinders, and have experimented that for meshes made of 100k faces, the whole binary tree of clusters can be built in about...

• Type: Journal
• Year: 2006
• Where: CG
• Authors: Bianca Falcidieno, Remco C. Veltkamp
• Keywords: Binary Tree, CG 2006, Computer Graphics, Reverse Engineering, Single Cluster