Digital Straight Lines and Convexity of Digital Regions
From MaRDI portal
Publication:3945155
DOI10.1109/TPAMI.1982.4767221zbMath0485.52007OpenAlexW2006706577WikidataQ39996058 ScholiaQ39996058MaRDI QIDQ3945155
Azriel Rosenfeld, Chul Eung Kim
Publication date: 1982
Published in: IEEE Transactions on Pattern Analysis and Machine Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tpami.1982.4767221
Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Convex sets in (2) dimensions (including convex curves) (52A10) Discrete mathematics in relation to computer science (68R99)
Related Items
Lyndon + Christoffel = digitally convex ⋮ Parallel, overlapped, and intersected digital straight lines ⋮ Convexity preserving deformations of digital sets: characterization of removable and insertable pixels ⋮ An envelope operator for full convexity to define polyhedral models in digital spaces ⋮ Full convexity for polyhedral models in digital spaces ⋮ Efficiently testing digital convexity and recognizing digital convex polygons ⋮ Geometric preservation of 2D digital objects under rigid motions ⋮ Computing convexity properties of images on a pyramid computer ⋮ The indecomposability problem in binary morphology: an algebraic approach ⋮ Faithful polygonal representation of the convex and concave parts of a digital curve ⋮ Combinatorial View of Digital Convexity ⋮ An alternative definition for digital convexity ⋮ An alternative definition for digital convexity ⋮ CHARACTERIZING DIGITAL STRAIGHTNESS AND DIGITAL CONVEXITY BY MEANS OF DIFFERENCE OPERATORS ⋮ Digital convex + unimodular mapping = 8-connected (all points but one 4-connected) ⋮ Digital straightness -- a review ⋮ Efficient Algorithms to Test Digital Convexity ⋮ Detection of the discrete convexity of polyominoes
