Title :
Three-Dimensional Digital Planes
Author_Institution :
Department of Computer Science, Washington State University, Pullman, WA 99164.
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.
Keywords :
Algorithm design and analysis; Computer science; Digital images; Geometry; Image processing; Solids; Sufficient conditions; Terminology; 3-D digital plane; 3-D digital surface; Algorithm; chordal triangle property; convex digital plane element; digital convexity; volume property;
Journal_Title :
Pattern Analysis and Machine Intelligence, IEEE Transactions on
DOI :
10.1109/TPAMI.1984.4767578
