Digital Straight Line Segments
From MaRDI portal
Publication:4042687
Cited in
(41)- Two equivalence relations on digital lines with irrational slopes. A continued fraction approach to upper mechanical words
- On the min DSS problem of closed discrete curves
- Digital lines with irrational slopes
- Least squares fitting of digital polynomial segments
- Geometric interpretation of the Euclidean algorithm and recognition of segments
- Dilated Floor Functions That Commute
- A combinatorial technique for generation of digital plane using GCD
- Canonical representations of discrete curves
- Digital straightness, circularity, and their applications to image analysis
- Parallel, overlapped, and intersected digital straight lines
- Homotopic properties of an \textit{MA}-digitization of 2D Euclidean spaces
- Plane digitization and related combinatorial problems
- On the recognition of digital circles in linear time
- An elementary algorithm for digital arc segmentation
- Homotopic properties of \(KA\)-digitizations of \(n\)-dimensional Euclidean spaces
- A note on the approximation of linear and affine functions: The case of bounded slope
- Translation of a Digital Line into another according to various Digitization Processes
- Non-local estimators: a new class of multigrid convergent length estimators
- A study on the properties of 3D digital straight line segments
- Continuous digitization in Khalimsky spaces
- Digital straightness -- a review
- An integral linear interpolation approach to the design of incremental line algorithms
- Piercing the Chessboard
- The encoding of arbitrary two-dimensional geometric configurations
- Cubic approximation of curve-shaped objects in \(\mathbb Z^{2}\): a generalized approach based on discrete curvature
- Hereditary properties of semi-separation axioms and their applications
- Digital geometry
- Digitizations associated with several types of digital topological approaches
- Computing convexity properties of images on a pyramid computer
- On the min DSS problem of closed discrete curves
- The number of Khalimsky-continuous functions between two points
- Digital straightness
- Separability and Tight Enclosure of Point Sets
- Contour coding through stretching of discrete circular arcs by affine transformation
- Covering a Euclidean line or hyperplane by dilations of its discretization
- Criteria for approximation of linear and affine functions
- On the flatness of digital hyperplanes
- The encoding of arbitrary surfaces in 3-dimensional space
- Iterated Floor Function, Algebraic Numbers, Discrete Chaos, Beatty Subsequences, Semigroups
- An elementary algorithm for digital arc segmentation
- Characterizing digital straightness and digital convexity by means of difference operators
This page was built for publication: Digital Straight Line Segments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4042687)
