Polyhedral Surface Approximation of Non-Convex Voxel Sets and Improvements to the Convex Hull Computing Method


Polyhedral Surface Approximation of Non-Convex Voxel Sets and Improvements to the Convex Hull Computing Method

Schulz, H.

In this paper we 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. The second aim of this paper is to present some improvements to our convex hull algorithm to reduce computation time.

Keywords: digital geometry; surface approximation; abstract cell complex; polyhedron; voxel

  • Open Access Logo Wissenschaftlich-Technische Berichte / Helmholtz-Zentrum Dresden-Rossendorf; FZD-514 2009
    ISSN: 1437-322X

Downloads

Permalink: https://www.hzdr.de/publications/Publ-12497
Publ.-Id: 12497