Circular Arc Segmentation by Curvature Estimation and Geometric Validation

Abstract

A novel algorithm to detect circular arcs from a digital image is proposed. The algorithm is based on discrete curvature estimated for the constituent points of digital curve segments, followed by a fast geometric analysis. The curvature information is used in the initial stage to find the potentially circular segments. In the final stage, the circular arcs are merged and maximized in length using the radius and center information of the potentially circular segments. Triplets of longer segments are given higher priorities; doublets and singleton arcs are processed at the end. Detailed experimental results on benchmark datasets demonstrate its efficiency and robustness.

A digital geometric approach for discrete Voronoi diagram construction using GPU

“…Voronoi diagrams have many applications in various fields, including computer science, physics, and engineering. [3][4][5][6] Voronoi diagrams can be constructed for any number of points in a plane or space.…”

“…The Voronoi diagram 2 is named after the Russian mathematician Georgy Voronoy, who studied them in the early 20th century. Voronoi diagrams have many applications in various fields, including computer science, physics, and engineering 3–6 . Voronoi diagrams can be constructed for any number of points in a plane or space.…”

“…Voronoi diagrams have many applications in various fields, including computer science, physics, and engineering. [3][4][5][6] Voronoi diagrams can be constructed for any number of points in a plane or space.Voronoi diagrams have a huge range of applications in various fields, hence, the study of the same is of importance. Some distinguished areas has been mentioned below.…”