An elementary algorithm for digital line recognition in the general case
From MaRDI portal
Recommendations
- A simple 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
Cited in
(11)- On the recognition of digital circles in linear time
- scientific article; zbMATH DE number 4211554 (Why is no real title available?)
- scientific article; zbMATH DE number 4057076 (Why is no real title available?)
- A new characterization of digital lines by least square fits
- A linear incremental algorithm for naive and standard digital lines and planes recognition
- Collinearity and weak collinearity in the digital plane
- An incremental linear time algorithm for digital line and plane recognition using a linear incremental feasibility problem
- The linear time recognition of digital arcs
- A discrete geometry approach for dominant point detection
- Curvature estimation along noisy digital contours by approximate global optimization
- A simple algorithm for digital line recognition in the general case
This page was built for publication: An elementary 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 Q5316537)