Convex Digital Solids

DOI10.1109/TPAMI.1982.4767314MaRDI QIDQ3953197zbMATH OpenWikidataFDO

Authors 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.4767314

zbMATH Keywords

chord propertychordal triangle propertydigital convexityefficient algorithmhalf-cell expansionsemidigital point

Mathematics Subject Classification ID

Convex sets in (3) dimensions (including convex surfaces) (52A15) Discrete mathematics in relation to computer science (68R99)

Cited in

(13)

• Computing convexity properties of images on a pyramid computer
• An elementary algorithm for digital arc segmentation
• Digital convex + unimodular mapping = 8-connected (all points but one 4-connected)
• Efficiently testing digital convexity and recognizing digital convex polygons
• Efficient Algorithms to Test Digital Convexity
• An alternative definition for digital convexity
• An alternative definition for digital convexity
• 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
• New properties for full convex sets and full convex hulls
• Controlled peeling of fully convex digital sets and thin envelope
• Digital planarity -- a review

This page was built for publication: Convex Digital Solids

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