An elementary algorithm for digital arc segmentation
From MaRDI portal
Publication:1827813
DOI10.1016/j.dam.2003.08.003zbMath1077.68107MaRDI 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
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
Digital Geometry in Image-Based Metrology, Separability and Tight Enclosure of Point Sets, Digital Straightness, Circularity, and Their Applications to Image Analysis, Topological relations between separating circles, On covering a digital disc with concentric circles in \(\mathbb Z^2\), Measure of circularity for parts of digital boundaries and its fast computation, Number-theoretic interpretation and construction of a digital circle, Digitization scheme that assures faithful reconstruction of plane figures, Determining digital circularity using integer intervals, Efficiently testing digital convexity and recognizing digital convex polygons, Fast circular arc segmentation based on approximate circularity and cuboid graph, About the decidability of polyhedral separability in the lattice \(\mathbb {Z}^d\). Recognizing digital polyhedra with a prescribed number of faces, Digital circles, spheres and hyperspheres: from morphological models to analytical characterizations and topological properties, Recognition of Digital Hyperplanes and Level Layers with Forbidden Points, Segmentation of Discrete Curves into Fuzzy Segments, On Three Constrained Versions of the Digital Circular Arc Recognition Problem, Multiscale Discrete Geometry, Ellipse Detection with Elemental Subsets
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
