Best approximate circles on integer grids
From MaRDI portal
Recommendations
- Approximation of polygons with the best set of circles
- Approximating sets on a plane with optimal sets of circles
- Approximating Euclidean circles by neighbourhood sequences in a hexagonal grid
- Approximating the Euclidean circle in the square grid using neighbourhood sequences
- Polygon approximations of the Euclidean circles on the square grid by broadcasting sequences
- Algorithms of the best approximations of the flat sets by the union of circles
- Polynomial-time approximation schemes for circle packing problems
- An approximate method for circle packing and disc covering
- Approximation by circles
Cited in
(13)- Fast exact digital differential analyzer for circle generation
- On a recursive construction of circular paths and the search for \(\pi \) on the integer lattice \(\mathbb {Z}^2\)
- Digital circles, spheres and hyperspheres: from morphological models to analytical characterizations and topological properties
- A sweep-line algorithm for the inclusion hierarchy among circles
- Arithmetization of a circular arc
- On covering a digital disc with concentric circles in \(\mathbb Z^2\)
- Digital straightness, circularity, and their applications to image analysis
- scientific article; zbMATH DE number 218559 (Why is no real title available?)
- Polygon approximations of the Euclidean circles on the square grid by broadcasting sequences
- Embedding the double circle in a square grid of minimum size
- A chronological and mathematical overview of digital circle generation algorithms -- introducing efficient 4- and 8-connected circles
- Integer approximation of a segment
- Number-theoretic interpretation and construction of a digital circle
This page was built for publication: Best approximate circles on integer grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3707247)
