Name
Title | ||
|---|---|---|
Polyhedral surface approximation of non-convex voxel sets through the modification of convex hulls |
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-540-78275-9_4 | IWCIA |
Keywords | Field | DocType |
background voxels,convex hull,polyhedral surface approximation,three-dimensional binary image,background voxel component,polyhedral approximation,voxel set,non-convex voxel set,recursive repetition,three dimensional,binary image | Orthogonal convex hull,Convex conjugate,Mathematical optimization,Convex combination,Convex hull,Convex set,Convex polytope,Output-sensitive algorithm,Convex analysis,Mathematics | Conference |
Volume | ISSN | ISBN |
4958 | 0302-9743 | 3-540-78274-5 |
Citations | PageRank | References |
2 | 0.39 | 10 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Henrik Schulz | 1 | 39 | 5.76 |