Recursive computation of minimum-length polygons

Authors:
Gisela Klette
Affiliations:
AUT University, Private Bag 92006, Auckland 1142, New Zealand
Venue:
Computer Vision and Image Understanding
Year:
2013

Citing 11
Cited 0

On-line construction of the convex hull of a simple polyline

Information Processing Letters
An O (n log log n)-time algorithm for triangulating a simple polygon

SIAM Journal on Computing
On piecewise linear approximation of planar Jordan curves

Journal of Computational and Applied Mathematics
Hierarchical representation of 2-D shapes using convex polygons: a contour-based approach

Pattern Recognition Letters
Measuring Concavity on a Rectangular Mosaic

IEEE Transactions on Computers
Minimum-Perimeter Polygons of Digitized Silhouettes

IEEE Transactions on Computers
Two linear-time algorithms for computing the minimum length polygon of a digital contour

DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
Digital deformable model simulating active contours

DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
Recursive calculation of relative convex hulls

DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
Faithful polygonal representation of the convex and concave parts of a digital curve

Pattern Recognition
Euclidean Shortest Paths: Exact or Approximate Algorithms

Euclidean Shortest Paths: Exact or Approximate Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

The relative convex hull, or the minimum-perimeter polygon (MPP) of a simple polygon A, contained in a second polygon B, is a unique polygon in the set of nested polygons between A and B. The computation of the minimum-length polygon (MLP), as a special case for isothetic polygons A and B, is useful for various applications in image analysis and robotics. The paper discusses the first recursive approach to compute the relative convex hull for the general case of simple polygons A and B, following an earlier publication by the author, and it derives a (methodologically more simple) algorithm to compute the MLP for the special case of isothetic polygons. The recursive algorithm for the isothetic case allows us to create rooted trees for digitized measurable sets S@?R^2. Those trees are useful for the characterization of digital convexity.