Abstract
Definitions of 3-D digital surface and plane are introduced. Many geometric properties of these objects are examined. In particular, it is shown that digital convexity is neither a necessary nor a sufficient condition for a digital surface element to be a convex digital plane element, but it is both necessary and sufficient for a digital surface to be a digital plane. Also algorithms are presented to determine whether or not a finite set of digital points is a (convex) digital plane element.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEE Transactions on Pattern Analysis and Machine Intelligence
Paper Title
Journal
Date
