English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/30271
Share/Impact:
Statistics
logo share SHARE   Add this article to your Mendeley library MendeleyBASE
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:

Title

Fast skeletonization of volumetric objects

AuthorsRodríguez Rojas, Jorge; Ros, Lluís ; Ayala Vallespi, Dolors; Thomas, Federico
Keywords3D skeletons
Solid modelling
Volume rendering
Object tracking
Animation
Medical imaging
Pattern recognition: Computer vision
Computer vision
Issue Date2003
PublisherUniversidad de La Coruña
CitationXIII Congreso Español de Informática Gráfica: 1-13 (2003)
AbstractMany 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 disconnections.
DescriptionCongreso Español de Informática Gráfica (CEIG), 2003, A Coruña (España)
URIhttp://hdl.handle.net/10261/30271
ISBN849749072X
Appears in Collections:(IRII) Comunicaciones congresos
Files in This Item:
File Description SizeFormat 
doc1.pdf237 kBAdobe PDFThumbnail
View/Open
Show full item record
Review this work
 


WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.