Digital Convexity, Straightness, and Convex Polygons
From MaRDI portal
Publication:3953196
DOI10.1109/TPAMI.1982.4767315zbMath0491.68073WikidataQ40030203 ScholiaQ40030203MaRDI QIDQ3953196
Publication date: 1982
Published in: IEEE Transactions on Pattern Analysis and Machine Intelligence (Search for Journal in Brave)
Convex sets in (2) dimensions (including convex curves) (52A10) Discrete mathematics in relation to computer science (68R99)
Related Items (11)
Lyndon + Christoffel = digitally convex ⋮ Convex digital polygons, maximal digital straight segments and convergence of discrete geometric estimators ⋮ Efficiently testing digital convexity and recognizing digital convex polygons ⋮ Computing convexity properties of images on a pyramid computer ⋮ Discrete sets with minimal moment of inertia ⋮ Parallel algorithms for separation of two sets of points and recognition of digital convex polygons ⋮ A chronological and mathematical overview of digital circle generation algorithms – introducing efficient 4- and 8-connected circles ⋮ Faithful polygonal representation of the convex and concave parts of a digital curve ⋮ Combinatorial View of Digital Convexity ⋮ Digital straightness -- a review ⋮ Detection of the discrete convexity of polyominoes
This page was built for publication: Digital Convexity, Straightness, and Convex Polygons