Measure of circularity for parts of digital boundaries and its fast computation

DOI10.1016/j.patcog.2009.06.014zbMath1192.68606OpenAlexW2006011108MaRDI QIDQ733129

Laure Tougne, Isabelle Sivignon, Tristan Roussillon

Publication date: 15 October 2009

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2009.06.014

zbMATH Keywords

compactnessdiscrete geometrycomputational geometrydigital circlecircularity

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Pattern recognition, speech recognition (68T10)

Related Items (10)

Topological relations between separating circles ⋮ Determining digital circularity using integer intervals ⋮ Grid anisotropy reduction for simulation of growth processes with cellular automaton ⋮ A projection-based method for shape measurement ⋮ Digital Straightness, Circularity, and Their Applications to Image Analysis ⋮ Numerical Solution of a Degenerate, Diffusion Reaction Based Biofilm Growth Model on Structured Non-Orthogonal Grids ⋮ Fast circular arc segmentation based on approximate circularity and cuboid graph ⋮ Faithful polygonal representation of the convex and concave parts of a digital curve ⋮ Measure of circularity for parts of digital boundaries and its fast computation ⋮ On Three Constrained Versions of the Digital Circular Arc Recognition Problem

Cites Work

• Measure of circularity for parts of digital boundaries and its fast computation
• Computing circular separability
• On-line construction of the convex hull of a simple polyline
• Voronoi diagrams from convex hulls
• Establishment of a pair of concentric circles with the minimum radial separation for assessing roundness error
• On the maximal number of edges of convex digital polygons included into an \(m \times m\)-grid
• Approximation algorithms for minimum-width annuli and shells
• An elementary algorithm for digital arc segmentation
• Testing the quality of manufactured disks and balls
• An optimal algorithm for roundness determination on convex polygons
• Real-time accurate circle fitting with occlusions
• Use of the Hough transformation to detect lines and curves in pictures
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• Linear Programming in Linear Time When the Dimension Is Fixed
• A Measure for Circularity of Digital Figures
• The linear time recognition of digital arcs
• Approximation by circles
• On the circle closest to a set of points
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Measure of circularity for parts of digital boundaries and its fast computation