Best approximate circles on integer grids
ACM Transactions on Graphics (TOG)
Digital circles with non-lattice point centers
The Visual Computer: International Journal of Computer Graphics
Discrete analytical hyperplanes
Graphical Models and Image Processing
Computer Processing of Line-Drawing Images
ACM Computing Surveys (CSUR)
A linear algorithm for incremental digital display of circular arcs
Communications of the ACM
The Discrete Analytical Hyperspheres
IEEE Transactions on Visualization and Computer Graphics
Digital Straight Line Segments
IEEE Transactions on Computers
Algorithm for computer control of a digital plotter
IBM Systems Journal
O(n 3logn) time complexity for the optimal consensus set computation for 4-Connected Digital Circles
DGCI'13 Proceedings of the 17th IAPR international conference on Discrete Geometry for Computer Imagery
Efficient robust digital annulus fitting with bounded error
DGCI'13 Proceedings of the 17th IAPR international conference on Discrete Geometry for Computer Imagery
| Hi-index | 0.00 |
In the framework of the arithmetic discrete geometry, a discrete object is provided with its own analytical definition corresponding to a discretization scheme It can thus be considered as the equivalent, in a discrete space, of a Euclidean object Linear objects, namely lines and hyperplanes, have been widely studied under this assumption and are now deeply understood This is not the case for discrete circles and hyperspheres for which no satisfactory definition exists In the present paper, we try to fill this gap Our main results are a general definition of discrete hyperspheres and the characterization of the k-minimal ones thanks to an arithmetic definition based on a non-constant thickness function To reach such topological properties, we link adjacency and separatingness with norms.