Efficient computation of 3D skeletons by extreme vertex encoding
Many skeletonisation algorithms for discrete volumes have been proposed. Despite its simplicity, the one given here still has many theoretically favorable properties. Actually, it provides a connected surface skeleton that allows shapes to be reconstructed with bounded error. It is based on the appl...
| Authors: | ; ; ; |
|---|---|
| Format: | Article |
| Publication date: | 2003 |
| Country: | España |
| Institution: | Universitat Politècnica de Catalunya (UPC) |
| Repository: | UPCommons. Portal del coneixement obert de la UPC |
| Language: | English |
| OAI Identifier: | oai:upcommons.upc.edu:2117/9244 |
| Online Access: | https://hdl.handle.net/2117/9244 https://dx.doi.org/10.1007/b94107 |
| Access Level: | Open access |
| Keyword: | Robotics Robòtica Classificació INSPEC::Automation::Robots Àrees temàtiques de la UPC::Informàtica::Robòtica |
| Summary: | Many skeletonisation algorithms for discrete volumes have been proposed. Despite its simplicity, the one given here still has many theoretically favorable properties. Actually, it provides a connected surface skeleton that allows shapes to be reconstructed with bounded error. It is based on the application of directional erosions, while retaining those voxels that introduce disconnections. This strategy is proved to be specially well-suited for extreme vertex encoded volumes, leading to a fast thinning algorithm. |
|---|