A new algorithmic approach to the computation of Minkowski functionals of polyconvex sets
From MaRDI portal
Publication:2495945
DOI10.1016/j.comgeo.2006.02.002zbMath1104.65012OpenAlexW1965979502MaRDI QIDQ2495945
Simone Klenk, Evgueni Spodarev, Volker Schmidt
Publication date: 30 June 2006
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2006.02.002
Related Items (10)
Valuations in Image Analysis ⋮ Characterizing digital microstructures by the Minkowski‐based quadratic normal tensor ⋮ On the estimation of intrinsic volume densities of stationary random closed sets ⋮ Voronoi-based estimation of Minkowski tensors from finite point samples ⋮ Local Digital Algorithms Applied to Boolean Models ⋮ Asymptotic properties of estimators for the volume fractions of jointly stationary random sets ⋮ Approximations of the Wiener sausage and its curvature measures ⋮ Estimation of fractal dimension and fractal curvatures from digital images ⋮ Single Scan Granulometry Estimation from an Asymmetric Distance Map ⋮ The effect of discretization on the mean geometry of a 2D random field
Uses Software
Cites Work
This page was built for publication: A new algorithmic approach to the computation of Minkowski functionals of polyconvex sets
