Convex Digital Solids
From MaRDI portal
Publication:3953197
DOI10.1109/TPAMI.1982.4767314zbMath0491.68074WikidataQ40030198 ScholiaQ40030198MaRDI QIDQ3953197
Azriel Rosenfeld, Chul Eung Kim
Publication date: 1982
Published in: IEEE Transactions on Pattern Analysis and Machine Intelligence (Search for Journal in Brave)
efficient algorithmdigital convexityhalf-cell expansionchord propertychordal triangle propertysemidigital point
Convex sets in (3) dimensions (including convex surfaces) (52A15) Discrete mathematics in relation to computer science (68R99)
Related Items (11)
Digital planarity -- a review ⋮ An envelope operator for full convexity to define polyhedral models in digital spaces ⋮ A combinatorial technique for generation of digital plane using GCD ⋮ Full convexity for polyhedral models in digital spaces ⋮ Efficiently testing digital convexity and recognizing digital convex polygons ⋮ Computing convexity properties of images on a pyramid computer ⋮ An alternative definition for digital convexity ⋮ An alternative definition for digital convexity ⋮ Digital convex + unimodular mapping = 8-connected (all points but one 4-connected) ⋮ An elementary algorithm for digital arc segmentation ⋮ Efficient Algorithms to Test Digital Convexity
This page was built for publication: Convex Digital Solids
