Parallel skeletonization algorithms in the cubic grid based on critical kernels - École des Ponts ParisTech Access content directly
Book Sections Year : 2017

Parallel skeletonization algorithms in the cubic grid based on critical kernels

Abstract

We propose two compact and generic thinning schemes, both based on the critical kernels framework, which encompass an enormous variety of homotopic parallel 3D thinning algorithms—including asym-metric and symmetric algorithms that produce ultimate, curve, surface, and other kinds of skeletons. Our algorithms are fast and our approach is validated experimentally. We also propose an effective filtering strategy based on the notion of isthmus persistence that can be easily performed within our framework.
Fichier principal
Vignette du fichier
CriticalSynthese.pdf (6.94 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01613008 , version 1 (09-10-2017)

Identifiers

  • HAL Id : hal-01613008 , version 1

Cite

Gilles Bertrand, Michel Couprie. Parallel skeletonization algorithms in the cubic grid based on critical kernels. Punam Saha Gunilla Borgefors Gabriella Sanniti di Baja. Skeletonization: Theory, Methods and Applications, Elsevier, pp.181-210, 2017, Skeletonization: Theory, Methods and Applications, 9780081012925. ⟨hal-01613008⟩
367 View
235 Download

Share

Gmail Facebook X LinkedIn More