An elementary algorithm for digital arc segmentation
From MaRDI portal
Publication:1827813
DOI10.1016/j.dam.2003.08.003zbMath1077.68107OpenAlexW2130583184MaRDI QIDQ1827813
Jean-Pierre Reveillès, David Coeurjolly, Yan Gerard, Laure Tougne
Publication date: 6 August 2004
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2003.08.003
Related Items
About the decidability of polyhedral separability in the lattice \(\mathbb {Z}^d\). Recognizing digital polyhedra with a prescribed number of faces ⋮ Topological relations between separating circles ⋮ On covering a digital disc with concentric circles in \(\mathbb Z^2\) ⋮ Determining digital circularity using integer intervals ⋮ Efficiently testing digital convexity and recognizing digital convex polygons ⋮ Digital circles, spheres and hyperspheres: from morphological models to analytical characterizations and topological properties ⋮ Recognition of Digital Hyperplanes and Level Layers with Forbidden Points ⋮ Number-theoretic interpretation and construction of a digital circle ⋮ Digital Geometry in Image-Based Metrology ⋮ Separability and Tight Enclosure of Point Sets ⋮ Digital Straightness, Circularity, and Their Applications to Image Analysis ⋮ Fast circular arc segmentation based on approximate circularity and cuboid graph ⋮ Measure of circularity for parts of digital boundaries and its fast computation ⋮ Digitization scheme that assures faithful reconstruction of plane figures ⋮ On Three Constrained Versions of the Digital Circular Arc Recognition Problem ⋮ Multiscale Discrete Geometry ⋮ Ellipse Detection with Elemental Subsets ⋮ Segmentation of Discrete Curves into Fuzzy Segments
Cites Work
- Discrete images, objects, and functions in \(Z^ n\)
- On the maximal number of edges of convex digital polygons included into an \(m \times m\)-grid
- Digital Disks
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Convex Digital Solids
- Digital Straight Line Segments
- The linear time recognition of digital arcs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
