Digital and cellular convexity

DOI10.1016/0031-3203(82)90038-3MaRDI QIDQ1164431zbMATH OpenOpenAlexFDO

Authors Jack Sklansky, Chul Eung Kim

Publication date 1982

Published in Pattern Recognition (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0031-3203(82)90038-3

zbMATH Keywords

blobcellular convexityconcavity shapedigital convexityhalf-cell expansionminimum-perimeter polygonsquare latticesquare mosaics

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99)

Cites work

• A Theory of Nonuniformly Digitized Binary Pictures
• Measuring Concavity on a Rectangular Mosaic
• Minimum-Perimeter Polygons of Digitized Silhouettes

Cited in

(6)

• Computing convexity properties of images on a pyramid computer
• Fault diagnosis based on comprehensive geometric characteristic and probability neural network
• Faithful polygonal representation of the convex and concave parts of a digital curve
• Computing the minimal perimeter polygon for digital objects in the triangular tiling
• Computing the minimal perimeter polygon for sets of rectangular tiles based on visibility cones
• Controlled peeling of fully convex digital sets and thin envelope

This page was built for publication: Digital and cellular convexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1164431)