Advertisement
Published in:
2005 | OriginalPaper | Chapter
An Approximation of the Maximal Inscribed Convex Set of a Digital Object
Authors : Gunilla Borgefors, Robin Strand
Published in: Image Analysis and Processing – ICIAP 2005
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
In several application projects we have discovered the need of computing the maximal inscribed convex set of a digital shape. Here we present an algorithm for computing a reasonable approximation of this set, that can be used in both 2D and 3D. The main idea is to iteratively identify the deepest concavity and then remove it by cutting off as little as possible of the shape. We show results using both synthetic and real examples.