The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.06 - June (1982 vol.4)
pp: 618-626
Chul E. Kim , Department of Computer Science, University of Maryland, College Park, MD 20742; Department of Computer Science, Washington State University, Pullman, WA 99163.
ABSTRACT
New schemes for digitizing regions and arcs are introduced. It is then shown that under these schemes, Sklansky's definition of digital convexity is equivalent to other definitions. Digital convex polygons of n vertices are defined and characterized in terms of geometric properties of digital line segments. Also, a linear time algorithm is presented that, given a digital convex region, determines the smallest integer n such that the region is a digital convex n-gon.
CITATION
Chul E. Kim, "Digital Convexity, Straightness, and Convex Polygons", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.4, no. 6, pp. 618-626, June 1982, doi:10.1109/TPAMI.1982.4767315
104 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool