Fast circular arc segmentation based on approximate circularity and cuboid graph
From MaRDI portal
Publication:2251258
DOI10.1007/s10851-013-0444-5zbMath1361.68290MaRDI QIDQ2251258
Partha Bhowmick, Shyamosree Pal
Publication date: 11 July 2014
Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10851-013-0444-5
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Circular arc extraction by direct clustering in a 3D Hough parameter space
- Measure of circularity for parts of digital boundaries and its fast computation
- Digital planarity -- a review
- Number-theoretic interpretation and construction of a digital circle
- A note on the problem of reporting maximal cliques
- Computational modeling of objects represented in images. Second international symposium, CompIMAGE 2010, Buffalo, NY, USA, May 5--7, 2010. Proceedings
- Geometry, morphology, and computational imaging. 11th international workshop on theoretical foundations of computer vision, Dagstuhl Castle, Germany, April 7--12, 2002. Revised papers
- On the recognition of digital circles in linear time
- An elementary algorithm for digital arc segmentation
- Robust fitting of circle arcs
- Determining digital circularity using integer intervals
- An Efficient Randomized Algorithm for Detecting Circles
- Analytical Description of Digital Circles
- Generalized Perpendicular Bisector and Circumcenter
- Real Polygonal Covers of Digital Discs – Some Theories and Experiments
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Finding circles by an array of accumulators
- A linear algorithm for incremental digital display of circular arcs
- A Measure for Circularity of Digital Figures
- A two-step circle detection algorithm from the intersecting chords
- The linear time recognition of digital arcs
- Listing All Maximal Cliques in Large Sparse Real-World Graphs
- Algorithm for drawing ellipses or hyperbolae with a digital plotter
- Algorithm 457: finding all cliques of an undirected graph