An extended concept of voxel neighborhoods for correct thinning in mesh segmentation

We present a method for mesh segmentation based on volume representation and the so called skeleton graph. In this method, the triangle mesh is first trans-formed into a voxel representation. A thinning algorithm based on our definition of a local neighborhood is employed to extract a voxel skeleton which is then transformed into a graph representation. The branching points of this graph are used to define the segmentation of the mesh.This article focuses on the data structure used to manage the voxel set and the extension of the neighborhood concept that allows to distinguish be-tween local and global neighborhoods. Our rasteriza-tion is not based on equilateral cells, leading to an efficient data structure in terms of memory usage.