Polyhedral approximation and practical convex hull algorithm for certain classes of voxel sets
type: Item
instance of: scholarly article
title: Polyhedral approximation and practical convex hull algorithm for certain classes of voxel sets
zbMATH Open document ID: 1186.68510
author: Henrik Schulz
published in: Discrete Applied Mathematics
publication date: 2010-04-28T00:00:00Z
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 5702663
zbMATH Keywords: digital geometry
zbMATH Keywords: convex hull
zbMATH Keywords: abstract cell complex
zbMATH Keywords: abstract polyhedron
zbMATH Keywords: surface approximation
describes a project that uses: DeWall
MaRDI profile type: Publication
full work available at URL: j.dam.2009.04.008
OpenAlex ID: W1973425762
cites work: Surface Approximation and Geometric Partitions
cites work: Almost optimal set covers in finite VC-dimension
cites work: DeWall: a fast divide and conquer Delaunay triangulation algorithm in \(E^d\).
cites work: On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees
cites work: Q4263850
cites work: Combinatorial Image Analysis
cites work: Q4295776
cites work: Discrete Geometry for Computer Imagery
DOI: 10.1016/J.DAM.2009.04.008
description: scientific article; zbMATH DE number 5702663