Representation of digital line segments and their preimages

DOI10.1016/0734-189X(85)90161-6zbMath0622.68076OpenAlexW2082496770MaRDI QIDQ3759962

Timothy A. Anderson, Chul Eung Kim

Publication date: 1985

Published in: Computer Vision, Graphics, and Image Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0734-189x(85)90161-6

zbMATH Keywords

image processingLinear time algorithmsperiod on digital line segments

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computing methodologies and applications (68U99)

Related Items (8)

Two efficient algorithms for computing the characteristics of a subsegment of a digital straight line ⋮ An optimal parallel algorithm for digital curve segmentation ⋮ An optimal parallel algorithm for digital curve segmentation using hough polygons and monotone function search ⋮ Separability and Tight Enclosure of Point Sets ⋮ Digital Straightness ⋮ Remainder approach for the computation of digital straight line subsegment characteristics ⋮ Analytical description of digital intersections: minimal parameters and multiscale representation ⋮ Digital straightness -- a review

This page was built for publication: Representation of digital line segments and their preimages