The linear time recognition of digital arcs
From MaRDI portal
Recommendations
Cited in
(17)- An optimal parallel algorithm for digital curve segmentation
- On the recognition of digital circles in linear time
- An elementary algorithm for digital arc segmentation
- Determining digital circularity using integer intervals
- Fast circular arc segmentation based on approximate circularity and cuboid graph
- Digital circles, spheres and hyperspheres: from morphological models to analytical characterizations and topological properties
- Computing the Characteristics of a SubSegment of a Digital Straight Line in Logarithmic Time
- On Three Constrained Versions of the Digital Circular Arc Recognition Problem
- Topological relations between separating circles
- Graphical Techniques for Detecting Lines with the Hough Transform
- Separability and Tight Enclosure of Point Sets
- Digital straightness, circularity, and their applications to image analysis
- An elementary algorithm for digital arc segmentation
- Discrete Geometry for Computer Imagery
- An optimal parallel algorithm for digital curve segmentation using hough polygons and monotone function search
- Measure of circularity for parts of digital boundaries and its fast computation
- A simple algorithm for digital line recognition in the general case
This page was built for publication: The linear time recognition of digital arcs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4840363)
