Name
Title | ||
|---|---|---|
Polyhedral approximation and practical convex hull algorithm for certain classes of voxel sets |
Abstract | ||
|---|---|---|
In this paper we introduce an algorithm for the creation of polyhedral approximations for certain kinds of digital objects in a three-dimensional space. The objects are sets of voxels represented as strongly connected subsets of an abstract cell complex. The proposed 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 practical improvements to the discussed convex hull algorithm to reduce computation time. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.dam.2009.04.008 | Discrete Applied Mathematics |
Keywords | Field | DocType |
convex hull,digital object,abstract cell complex,digital geometry,certain kind,certain class,proposed algorithm,polyhedral approximation,background voxels,abstract polyhedron,surface approximation,background voxel component,computation time,voxel set,convex hull algorithm,practical convex hull algorithm,three dimensional | Orthogonal convex hull,Convex conjugate,Combinatorics,Convex combination,Algorithm,Convex hull,Convex set,Convex polytope,Output-sensitive algorithm,Gift wrapping algorithm,Mathematics | Journal |
Volume | Issue | ISSN |
157 | 16 | Discrete Applied Mathematics |
Citations | PageRank | References |
4 | 0.42 | 10 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Henrik Schulz | 1 | 39 | 5.76 |