Digital straightness, circularity, and their applications to image analysis
From MaRDI portal
Publication:4648755
Recommendations
Cites work
- A High-Speed Algorithm for the Generation of Straight Lines and Circular Arcs
- A linear algorithm for incremental digital display of circular arcs
- A Measure for Circularity of Digital Figures
- A new method for polygonal approximation using genetic algorithms
- A New Randomized Algorithm for Detecting Lines
- A Piecewise Linear Approximation Based on a Statistical Model
- A two-step circle detection algorithm from the intersecting chords
- Algorithm for drawing ellipses or hyperbolae with a digital plotter
- An efficient randomized algorithm for detecting circles
- An elementary algorithm for digital arc segmentation
- An optimal polygonal boundary encoding scheme in the rate distortion sense
- Ant colony search algorithms for optimal polygonal approximation of plane curves.
- Arithmetization of a circular arc
- Best approximate circles on integer grids
- Circular arc extraction by direct clustering in a 3D Hough parameter space
- Circular arc reconstruction of digital contours with chosen Hausdorff error
- Combinatorial Relations for Digital Pictures
- Combinatorial topologies for discrete planes.
- Computational modeling of objects represented in images. Second international symposium, CompIMAGE 2010, Buffalo, NY, USA, May 5--7, 2010. Proceedings
- Connectivity of discrete planes
- Convex digital polygons, maximal digital straight segments and convergence of discrete geometric estimators
- Covering a Set of Points with a Minimum Number of Lines
- Covering things with things
- Curvature and Tangential Deflection of Discrete Arcs: A Theory Based on the Commutator of Scatter Matrix Pairs and Its Application to Vertex Detection in Planar Shape Data
- Determining digital circularity using integer intervals
- Digital calculus
- Digital Disks
- Digital geometry -- the birth of a new discipline
- Digital planarity -- a review
- Digital Straight Line Segments
- Digital straightness
- Digital straightness -- a review
- Disc covering problem with application to digital halftoning
- Fast circular arc segmentation based on approximate circularity and cuboid graph
- Generalized Perpendicular Bisector and Circumcenter
- Geometry, morphology, and computational imaging. 11th international workshop on theoretical foundations of computer vision, Dagstuhl Castle, Germany, April 7--12, 2002. Revised papers
- Graceful planes and lines.
- scientific article; zbMATH DE number 2129318 (Why is no real title available?)
- scientific article; zbMATH DE number 4211509 (Why is no real title available?)
- scientific article; zbMATH DE number 4211975 (Why is no real title available?)
- scientific article; zbMATH DE number 3900665 (Why is no real title available?)
- scientific article; zbMATH DE number 3594676 (Why is no real title available?)
- scientific article; zbMATH DE number 718142 (Why is no real title available?)
- scientific article; zbMATH DE number 1958108 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- scientific article; zbMATH DE number 1744992 (Why is no real title available?)
- Linear-Time Algorithms for Linear Programming in R^3 and Related Problems
- Local Lines: A linear time line detector
- Measure of circularity for parts of digital boundaries and its fast computation
- Multiscale discrete geometry
- Number-theoretic interpretation and construction of a digital circle
- On digital plane preimage structure
- On Models for Line Detection
- On the complexity of locating linear facilities in the plane
- On the number of factors of Sturmian words
- On the polyhedral complexity of the integer points in a hyperball
- On the recognition of digital circles in linear time
- On Three Constrained Versions of the Digital Circular Arc Recognition Problem
- Optimum polygonal approximation of digitized curves
- Some theoretical challenges in digital geometry: a perspective
- Special issue: Advances in combinatorial image analysis. Extended selected papers based on the presentations at the 12th international workshop on combinatorial image analysis (IWCIA 2008), Buffalo, NY, USA, April 2008.
- The linear time recognition of digital arcs
- The number of digital straight lines on an N*N grid
Cited in
(4)
This page was built for publication: Digital straightness, circularity, and their applications to image analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4648755)
