Showing papers on "Convex hull algorithms published in 2003"
29 Jun 2003
TL;DR: This work compute discrete convex hulls in 2D grey-level images, where they interpret grey- level values as heights in 3D landscapes using a 3D binary method.
Abstract: We compute discrete convex hulls in 2D grey-level images, where we interpret grey-level values as heights in 3D landscapes. For these 3D objects, using a 3D binary method, we compute approximations of their convex hulls. Differently from other grey-level convex hull algorithms, producing results convex only in the geometric sense, our convex hull is convex also in the grey-level sense.
3 citations
Posted Content•
TL;DR: This paper presents a new algorithm for the convex hull problem, which is based on a reduction to a combinatorial decision problem CompletenessC, which in turn can be solved by a simplicial homology computation.
Abstract: This paper presents a new algorithm for the convex hull problem, which is based on a reduction to a combinatorial decision problem POLYTOPE-COMPLETENESS-COMBINATORIAL, which in turn can be solved by a simplicial homology computation. Like other convex hull algorithms, our algorithm is polynomial (in the size of input plus output) for simplicial or simple input. We show that the ``no''-case of POLYTOPE-COMPLETENESS-COMBINATORIAL has a certificate that can be checked in polynomial time (if integrity of the input is guaranteed).
01 Jan 2003
TL;DR: This work computes discrete convex hulls in 2D grey-level images, where the values are interpreted as heights in 3D landscapes, using a 3D binary method.
Abstract: We compute discrete convex hulls in 2D grey-level images, where we interpret grey-level values as heights in 3D landscapes. For these 3D objects, using a 3D binary method, we compute approxima- tions of their convex hulls. Dierently from other grey-level convex hull algorithms, producing results convex only in the geometric sense, our convex hull is convex also in the grey-level sense.