A simple algorithm for digital line recognition in the general case
From MaRDI portal
Recommendations
- An elementary algorithm for digital line recognition in the general case
- An incremental linear time algorithm for digital line and plane recognition using a linear incremental feasibility problem
- A linear incremental algorithm for naive and standard digital lines and planes recognition
- scientific article; zbMATH DE number 4057076
- The linear time recognition of digital arcs
Cites work
- A linear incremental algorithm for naive and standard digital lines and planes recognition
- Computing the width of a set
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 1436417 (Why is no real title available?)
- On-line construction of the convex hull of a simple polyline
Cited in
(8)- Integral invariants for space motion trajectory matching and recognition
- About the decidability of polyhedral separability in the lattice \(\mathbb {Z}^d\). Recognizing digital polyhedra with a prescribed number of faces
- An Efficient Structural Technique for Encoding 'Best-fit' Straight Lines
- A linear incremental algorithm for naive and standard digital lines and planes recognition
- Collinearity and weak collinearity in the digital plane
- Translation of a Digital Line into another according to various Digitization Processes
- An incremental linear time algorithm for digital line and plane recognition using a linear incremental feasibility problem
- An elementary algorithm for digital line recognition in the general case
This page was built for publication: A simple algorithm for digital line recognition in the general case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q877107)