Computational geometry: an introduction
Computational geometry: an introduction
Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Finite topology as applied to image analysis
Computer Vision, Graphics, and Image Processing
Computational geometry in C
On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees
Computational Geometry: Theory and Applications
Surface Approximation and Geometric Partitions
SIAM Journal on Computing
Algorithms and Data Structures for Computer Topology
Digital and Image Geometry, Advanced Lectures [based on a winter school held at Dagstuhl Castle, Germany in December 2000]
Convex hulls in a 3-dimensional space
IWCIA'04 Proceedings of the 10th international conference on Combinatorial Image Analysis
Algorithms in digital geometry based on cellular topology
IWCIA'04 Proceedings of the 10th international conference on Combinatorial Image Analysis
Polyhedral approximation and practical convex hull algorithm for certain classes of voxel sets
Discrete Applied Mathematics
Hi-index | 0.00 |
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.