Determining digital circularity using integer intervals
From MaRDI portal
Publication:1932889
DOI10.1007/s10851-011-0270-6zbMath1255.68262OpenAlexW2018215909MaRDI QIDQ1932889
Partha Bhowmick, Shyamosree Pal
Publication date: 22 January 2013
Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10851-011-0270-6
Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (6)
From prima quadraginta octant to lattice sphere through primitive integer operations ⋮ On the characterization of absentee-voxels in a spherical surface and volume of revolution in \({\mathbb Z}^3\) ⋮ On covering a digital disc with concentric circles in \(\mathbb Z^2\) ⋮ A projection-based method for shape measurement ⋮ Digital Straightness, Circularity, and Their Applications to Image Analysis ⋮ Fast circular arc segmentation based on approximate circularity and cuboid graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Connectivity of discrete planes
- 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
- On the polyhedral complexity of the integer points in a hyperball
- Computational modeling of objects represented in images. Second international symposium, CompIMAGE 2010, Buffalo, NY, USA, May 5--7, 2010. Proceedings
- Digital calculus
- Geometry, morphology, and computational imaging. 11th international workshop on theoretical foundations of computer vision, Dagstuhl Castle, Germany, April 7--12, 2002. Revised papers
- Graceful planes and lines.
- On the recognition of digital circles in linear time
- An elementary algorithm for digital arc segmentation
- On digital plane preimage structure
- Generalized Perpendicular Bisector and Circumcenter
- Digital Disks
- On Three Constrained Versions of the Digital Circular Arc Recognition Problem
- Arithmetization of a Circular Arc
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- 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
- Algorithm for drawing ellipses or hyperbolae with a digital plotter
This page was built for publication: Determining digital circularity using integer intervals
