Fast and Accurate Approximation of Digital Shape Thickness Distribution in Arbitrary Dimension

David Coeurjolly 1
1 M2DisCo - Geometry Processing and Constrained Optimization
LIRIS - Laboratoire d'InfoRmatique en Image et Systèmes d'information
Abstract : We present a fast and accurateapproximation of the Euclidean thicknessdistribution computation of a binary shape in arbitrarydimension. Thickness functions associate a value representing the local thickness for each point of a binary shape. When considering with the Euclidean metric, a simple definition is to associate with each point x, the radius of the largest ball inscribed in the shape containing x. Such thicknessdistributions are widely used in many applications such as medical imaging or material sciences and direct implementations could be time consuming. In this paper, we focus on fast algorithms to extract such distribution on shapes in arbitrarydimension.
Complete list of metadatas

Cited literature [28 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00758070
Contributor : David Coeurjolly <>
Submitted on : Thursday, December 6, 2012 - 5:11:41 PM
Last modification on : Thursday, November 1, 2018 - 1:19:15 AM
Long-term archiving on : Thursday, March 7, 2013 - 2:45:09 AM

File

fastThickness.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution - ShareAlike 4.0 International License

Identifiers

Citation

David Coeurjolly. Fast and Accurate Approximation of Digital Shape Thickness Distribution in Arbitrary Dimension. Computer Vision and Image Understanding, Elsevier, 2012, 116 (12), pp.1159-1167. ⟨10.1016/j.cviu.2012.08.006⟩. ⟨hal-00758070⟩

Share

Metrics

Record views

752

Files downloads

220