Show simple item record

dc.contributor.authorDurix, Bastienen_US
dc.contributor.authorMorin, Geraldineen_US
dc.contributor.authorChambon, Sylvieen_US
dc.contributor.authorMari, Jean-Lucen_US
dc.contributor.authorLeonard, Kathrynen_US
dc.contributor.editorCignoni, Paolo and Miguel, Ederen_US
dc.date.accessioned2019-05-05T17:49:43Z
dc.date.available2019-05-05T17:49:43Z
dc.date.issued2019
dc.identifier.issn1017-4656
dc.identifier.urihttps://doi.org/10.2312/egs.20191005
dc.identifier.urihttps://diglib.eg.org:443/handle/10.2312/egs20191005
dc.description.abstractComputing a skeleton for a discretized boundary typically produces a noisy output, with a skeletal branch produced for each boundary pixel. A simplification step often follows to reduce these noisy branches. As a result, generating a clean skeleton is usually a 2-step process. In this article, we propose a skeletonization process that produces a clean skeleton in the first step, avoiding the creation of branches due to noise. The resulting skeleton compares favorably with the most common pruning methods on a large database of shapes. Our process also reduces execution time and requires only one parameter, e, that designates the desired boundary precision in the Hausdorff distance.en_US
dc.publisherThe Eurographics Associationen_US
dc.titleOne-step Compact Skeletonizationen_US
dc.description.seriesinformationEurographics 2019 - Short Papers
dc.description.sectionheadersGeometry Processing
dc.identifier.doi10.2312/egs.20191005
dc.identifier.pages21-24


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record