Borgefors, Gunilla
- Centre for Image Analysis, Swedish University of Agricultural Sciences
Abstract
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
Published in
Lecture Notes in Computer Science
2005, volume: 3617, pages: 438-445
Title: Image Analysis and Processing (ICIAP'05)
Publisher: Springer, Berlin
Conference
13th International Conference on Image Analysis and Processing - ICIAP 2005
SLU Authors
UKÄ Subject classification
Computer Science
Permanent link to this page (URI)
https://res.slu.se/id/publ/8338