An approximation of the maximal inscribed convex set of a digital object

Authors:
Gunilla Borgefors;Robin Strand
Affiliations:
Centre for Image Analysis, Swedish University of Agricultural Sciences;Centre for Image Analysis, Uppsala University, Uppsala, Sweden
Venue:
ICIAP'05 Proceedings of the 13th international conference on Image Analysis and Processing
Year:
2005

Citing 5
Cited 1

Computational geometry: an introduction

Computational geometry: an introduction
Distance transformations in digital images

Computer Vision, Graphics, and Image Processing
Computing distance transformations in convex and non-convex domains

Pattern Recognition
Analyzing nonconvex 2D and 3D patterns

Computer Vision and Image Understanding
On digital distance transforms in three dimensions

Computer Vision and Image Understanding

A symmetric convexity measure

Computer Vision and Image Understanding

Quantified Score

Hi-index	0.00

Visualization

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.