Polyhedral approximation and practical convex hull algorithm for certain classes of voxel sets

DOI10.1016/j.dam.2009.04.008zbMath1186.68510OpenAlexW1973425762MaRDI QIDQ967409

Henrik Schulz

Publication date: 28 April 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2009.04.008

zbMATH Keywords

convex hullsurface approximationdigital geometryabstract polyhedronabstract cell complex

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (3)

Cup Products on Polyhedral Approximations of 3D Digital Images ⋮ A linear-time algorithm to compute the triangular hull of a digital object ⋮ A combinatorial algorithm to construct 3D isothetic covers

Uses Software

• DeWall

Cites Work

• Unnamed Item
• Unnamed Item
• On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees
• DeWall: a fast divide and conquer Delaunay triangulation algorithm in \(E^d\).
• Almost optimal set covers in finite VC-dimension
• Surface Approximation and Geometric Partitions
• Combinatorial Image Analysis
• Combinatorial Image Analysis
• Discrete Geometry for Computer Imagery

This page was built for publication: Polyhedral approximation and practical convex hull algorithm for certain classes of voxel sets