Resumen de Fast skeletonization of volumetric objects

Jorge Rodríguez, Lluís Ros Giralt, M. Dolors Ayala Vallespí , Federico Thomas Arroyo

• Many skeletonization algorithms for 3D solids have been proposed in recent years. The one given herein is surprisingly simple compared to most of them, but it is still very fast and has theoretically favorable properties. Actually, it provides a connected surface skeleton that allows shapes to be reconstructed with bounded error. Such skeleton is discretized, but can be computed at any desired resolution. In addition, the algorithm is also very attractive because it allows discrete skeletons to be obtained directly from solid objects in many representations without converting them to a voxel model. In other words, we present the first concise arbitrary-resolution skeletonization algorithm that does not require to necessarily work at voxel level. Our algorithm is a generalization of the one presented for 2D objects. It is based on the application of directional erosions, while retaining those regions whose elimination would introduce dis-connections.