Representation of digital line segments and their preimages
From MaRDI portal
Publication:3759962
DOI10.1016/0734-189X(85)90161-6zbMATH Open0622.68076OpenAlexW2082496770MaRDI QIDQ3759962FDOQ3759962
Authors: 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
Recommendations
Cited In (14)
- An optimal parallel algorithm for digital curve segmentation
- A new characterization of digital lines by least square fits
- Digital Straightness
- Translation of a Digital Line into another according to various Digitization Processes
- Digital straightness -- a review
- Remainder approach for the computation of digital straight line subsegment characteristics
- On digital plane preimage structure
- Digital straight segment filter for geometric description
- Separability and Tight Enclosure of Point Sets
- Constructing Consistent Digital Line Segments
- A Characterization of Consistent Digital Line Segments in ℤ2
- Two efficient algorithms for computing the characteristics of a subsegment of a digital straight line
- Analytical description of digital intersections: minimal parameters and multiscale representation
- An optimal parallel algorithm for digital curve segmentation using hough polygons and monotone function search
This page was built for publication: Representation of digital line segments and their preimages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3759962)