An Augmented Fast Marching Method for Computing Skeletons and Centerlines

Simple item page
dc.contributor.authorTelea, Alexandruen_US
dc.contributor.authorWijk, Jarke J. vanen_US
dc.contributor.editorD. Ebert and P. Brunet and I. Navazoen_US
dc.date.accessioned2014-01-30T06:50:47Z
dc.date.available2014-01-30T06:50:47Z
dc.date.issued2002en_US
dc.description.abstractWe present a simple and robust method for computing skeletons for arbitrary planar objects and centerlines for 3D objects. We augment the Fast Marching Method (FMM) widely used in level set applications 11 by computing the paramterized boundary location every pixel came from during the boundary evolution. The resulting parameter field is then thresholded to produce the skeleton branches created by boundary features of a given size. The presented algorithm is straightforward to implement, has low memory costs and short execution times, and is robust with respect to the used threshold and initial shape noisiness. The produced skeletons are very similar to the ones delivered by more complex algorithms. Various 2D and 3D applications are presented.en_US
dc.description.seriesinformationEurographics / IEEE VGTC Symposium on Visualizationen_US
dc.identifier.isbn1-58113-536-Xen_US
dc.identifier.issn1727-5296en_US
dc.identifier.urihttps://doi.org/10.2312/VisSym/VisSym02/251-259en_US
dc.publisherThe Eurographics Associationen_US
dc.titleAn Augmented Fast Marching Method for Computing Skeletons and Centerlinesen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
251-259.pdf
Size:
576.13 KB
Format:
Adobe Portable Document Format
Download
Collections
VisSym02: Joint Eurographics - IEEE TCVG Symposium on Visualization