Three-Dimensional Digital Line Segments
- 1 March 1983
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. PAMI-5 (2) , 231-234
- https://doi.org/10.1109/tpami.1983.4767379
Abstract
Digital arcs in 3-D digital pictures are defined. The digital image of an arc is also defined. A digital arc is defined to be a digital line segment if it is the digital image of a line segment. It is shown that a digital line segment may be characterized by the chord property holding for its projections onto the coordinate planes. It is also shown that a digital line segment may not be characterized by its own chord property. A linear time algorithm is presented that determines whether or not a digital arc is a digital line segment.Keywords
This publication has 15 references indexed in Scilit:
- An efficient algorith for determining the convex hull of a finite planar setPublished by Elsevier ,2002
- A parallel thinning algorithm for 3-D picturesComputer Graphics and Image Processing, 1981
- On the Cellular Convexity of ComplexesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- Dynamic boundary surface detectionComputer Graphics and Image Processing, 1978
- Digital Straight Line SegmentsIEEE Transactions on Computers, 1974
- Measuring Concavity on a Rectangular MosaicIEEE Transactions on Computers, 1972
- Discrete Approximation of Continuous Convex BlobsSIAM Journal on Applied Mathematics, 1970
- On Limit Properties in Digitization SchemesJournal of the ACM, 1970
- Recognition of convex blobsPattern Recognition, 1970
- Connectivity in Digital PicturesJournal of the ACM, 1970