Digital Straight Line Segments
From MaRDI portal
Publication:4042687
DOI10.1109/T-C.1974.223845zbMath0291.68042OpenAlexW2078996548MaRDI QIDQ4042687
Publication date: 1974
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/t-c.1974.223845
Related Items (40)
A Study on the Properties of 3D Digital Straight Line Segments ⋮ Two equivalence relations on digital lines with irrational slopes. A continued fraction approach to upper mechanical words ⋮ Non-local estimators: a new class of multigrid convergent length estimators ⋮ Canonical representations of discrete curves ⋮ Parallel, overlapped, and intersected digital straight lines ⋮ A note on the approximation of linear and affine functions: The case of bounded slope ⋮ Covering a Euclidean line or hyperplane by dilations of its discretization ⋮ Dilated Floor Functions That Commute ⋮ Hereditary properties of semi-separation axioms and their applications ⋮ Digital lines with irrational slopes ⋮ A combinatorial technique for generation of digital plane using GCD ⋮ Piercing the Chessboard ⋮ Computing convexity properties of images on a pyramid computer ⋮ The Number of Khalimsky-Continuous Functions between Two Points ⋮ Translation of a Digital Line into another according to various Digitization Processes ⋮ Cubic approximation of curve-shaped objects in ℤ2: a generalized approach based on discrete curvature ⋮ Homotopic properties of an \textit{MA}-digitization of 2D Euclidean spaces ⋮ Homotopic properties of $KA$-digitizations of $n$-dimensional Euclidean spaces ⋮ Continuous digitization in Khalimsky spaces ⋮ Separability and Tight Enclosure of Point Sets ⋮ Digital Straightness, Circularity, and Their Applications to Image Analysis ⋮ Digitizations associated with several types of digital topological approaches ⋮ Digital Straightness ⋮ An Elementary Algorithm for Digital Arc Segmentation ⋮ Iterated Floor Function, Algebraic Numbers, Discrete Chaos, Beatty Subsequences, Semigroups ⋮ Digital geometry ⋮ Contour coding through stretching of discrete circular arcs by affine transformation ⋮ Plane digitization and related combinatorial problems ⋮ On the min DSS problem of closed discrete curves ⋮ On the recognition of digital circles in linear time ⋮ Geometric interpretation of the Euclidean algorithm and recognition of segments ⋮ CHARACTERIZING DIGITAL STRAIGHTNESS AND DIGITAL CONVEXITY BY MEANS OF DIFFERENCE OPERATORS ⋮ On the min DSS problem of closed discrete curves ⋮ The encoding of arbitrary two-dimensional geometric configurations ⋮ An elementary algorithm for digital arc segmentation ⋮ Digital straightness -- a review ⋮ An integral linear interpolation approach to the design of incremental line algorithms ⋮ Criteria for approximation of linear and affine functions ⋮ The encoding of arbitrary surfaces in 3-dimensional space ⋮ On the flatness of digital hyperplanes
This page was built for publication: Digital Straight Line Segments
