id: 05259080
dt: a
an: 05259080
au: Schulz, Henrik
ti: Polyhedral surface approximation of non-convex voxel sets through the
    modification of convex hulls.
so: Brimkov, Valentin E. (ed.) et al., Combinatorial image analysis. 12th
    international workshop, IWCIA 2008, Buffalo, NY, USA, April 7‒9,
    2008. Proceedings. Berlin: Springer (ISBN 978-3-540-78274-2/pbk).
    Lecture Notes in Computer Science 4958, 38-50 (2008).
py: 2008
pu: Berlin: Springer
la: EN
cc: 
ut: 
ci: 
li: doi:10.1007/978-3-540-78275-9_4
ab: Summary: In this paper we want to introduce an algorithm for the creation
    of polyhedral approximations for objects represented as strongly
    connected sets of voxels in three-dimensional binary images. The
    algorithm generates the convex hull of a given object and modifies the
    hull afterwards by recursive repetitions of generating convex hulls of
    subsets of the given voxel set or subsets of the background voxels. The
    result of this method is a polyhedron which separates object voxels
    from background voxels. The objects processed by this algorithm and
    also the background voxel components inside the convex hull of the
    objects are restricted to have genus 0.
rv: