On Three Constrained Versions of the Digital Circular Arc Recognition Problem

DOI10.1007/978-3-642-04397-0_4zbMath1261.68138OpenAlexW162393450MaRDI QIDQ3648770

Laure Tougne, Isabelle Sivignon, Tristan Roussillon

Publication date: 1 December 2009

Published in: Discrete Geometry for Computer Imagery (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04397-0_4

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (6)

Multigrid convergence for the MDCA curvature estimator ⋮ Topological relations between separating circles ⋮ Determining digital circularity using integer intervals ⋮ Accurate Curvature Estimation along Digital Contours with Maximal Digital Circular Arcs ⋮ Separability and Tight Enclosure of Point Sets ⋮ Digital Straightness, Circularity, and Their Applications to Image Analysis

Cites Work

• Unnamed Item
• Measure of circularity for parts of digital boundaries and its fast computation
• Computing circular separability
• On the recognition of digital circles in linear time
• An elementary algorithm for digital arc segmentation
• Digital Disks
• What Does Digital Straightness Tell about Digital Convexity?
• Linear Programming in Linear Time When the Dimension Is Fixed
• SUBPIXEL IMAGE REGISTRATION USING CIRCULAR FIDUCIALS
• A linear incremental algorithm for naive and standard digital lines and planes recognition
• The linear time recognition of digital arcs

This page was built for publication: On Three Constrained Versions of the Digital Circular Arc Recognition Problem