by Linjiang, Y and Klette, R
Abstract:
Relative convex hulls have been suggested for multigrid-convergent surface area estimation. Besides the existence of a convergence theorem there is no efficient algorithmic solution so far for calculating 3D relative convex hulls. This article discusses an approximative solution based on minimum-length polygon calculations. It is illustrated that this approximative calculation also proves (experimentally) to provide a multigrid convergent measurement. © 2002 IEEE.
Reference:
An approximative calculation of relative convex hulls for surface area estimation of 3D digital objects (Linjiang, Y and Klette, R), In Proceedings – International Conference on Pattern Recognition, volume 16, 2002.
Bibtex Entry:
@article{linjiang2002anobjects,
author = "Linjiang, Y and Klette, R",
journal = "Proceedings - International Conference on Pattern Recognition",
pages = "131--134",
title = "An approximative calculation of relative convex hulls for surface area estimation of 3D digital objects",
volume = "16",
year = "2002",
abstract = "Relative convex hulls have been suggested for multigrid-convergent surface area estimation. Besides the existence of a convergence theorem there is no efficient algorithmic solution so far for calculating 3D relative convex hulls. This article discusses an approximative solution based on minimum-length polygon calculations. It is illustrated that this approximative calculation also proves (experimentally) to provide a multigrid convergent measurement. © 2002 IEEE.",
issn = "1051-4651",
issue = "1",
keyword = "Digital geometry",
keyword = "Global polyhedrization",
keyword = "Relative convex hull",
keyword = "Surface measurement",
language = "eng",
}