Arnoldus, C. (2012) Fast and Robust Extraction of Curve Skeletons from Voxel Models. Bachelor's Thesis, Computing Science.
|
Text
thesis.pdf - Published Version Download (1MB) | Preview |
|
![[img]](https://fse.studenttheses.ub.rug.nl/style/images/fileicons/text.png) |
Text
ArnoldusAkkoord.pdf - Other Restricted to Registered users only Download (10kB) |
Abstract
There are many algorithms for computing curve skeletons. Most of them have their own notion of what a curve skeleton is and are tailored towards a specific purpose. This makes them inadequate for general use. Recently, a formal, general definition of curve skeletons was introduced based on the principle of equal-length geodesics. This definition is computable and includes an importance measure to rank the importance of the branches of the curve skeleton. An algorithm computing curve skeletons conforming this definition is already available. The purpose of this thesis is to put this algorithm to the test and provide background information on skeletonisation where necessary. The quality of the curve skeletons produced by this method is analysed, problems are noted and possible solutions presented. The conclusion is that, while the quality of the curve skeletons computed by this method is usually good, there are border cases in which there is room for improvement. The performance is also measured and several ways to improve the performance are introduced. This includes a parallel implementation of the algorithm, as the algorithm is found to be very suitable for parallelisation.
| Item Type: | Thesis (Bachelor's Thesis) |
|---|---|
| Degree programme: | Computing Science |
| Thesis type: | Bachelor's Thesis |
| Language: | English |
| Date Deposited: | 15 Feb 2018 07:50 |
| Last Modified: | 15 Feb 2018 07:50 |
| URI: | https://fse.studenttheses.ub.rug.nl/id/eprint/10384 |
Actions (login required)
 |
View Item |