Arithmetic Discrete Hyperspheres and Separatingness

  title={Arithmetic Discrete Hyperspheres and Separatingness},
  author={Christophe Fiorio and Jean-Luc Toutant},
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… 
On Some Local Topological Properties of Naive Discrete Sphere
Novel results on the local topological properties of the naive model of discrete sphere are presented, which follow from the bijection of each quadraginta octant of naive sphere with its projection map on the corresponding functional plane and from the characterization of certain jumps in the f-map.
Construction of Thinnest Digital Ellipsoid Using Inverse Projection and Recursive Integer Intervals
This paper investigates the problem of characterization and construction of digital ellipsoid to its thinnest (2-minimal) topological model and shows how it admits certain characterization based on isothetic-distance and functional-plane properties.
Characterization and Construction of Rational Circles on the Integer Plane
This paper presents some novel results related to discretization of circles on the integer plane when the center and the radius are specified by arbitrary rational numbers and shows how it finally culminates to an efficient algorithm for construction of rational circles using integer operations.
About the Decidability of Polyhedral Separability in the Lattice Zd
The recognition of primitives in digital geometry is deeply linked with separability problems. This framework leads us to consider the following problem of pattern recognition : Given a finite
Arithmetic characterization of polynomial-based discrete curves
In the present paper, discretization of curves based on polynomials in the 2-dimensional space is investigated and an arithmetic characterization of thin and connected discrete approximations of such curves is proposed.
Efficient Robust Digital Annulus Fitting with Bounded Error
This paper presents an approximation method featuring linear time complexity and bounded error in annulus width, by extending the approximation method previously proposed for digital hyperplane fitting.
A Digital-Geometric Algorithm for Generating a Complete Spherical Surface in ℤ3
An algorithm is designed to fill up the absentee voxels so as to generate a spherical surface of revolution, which is complete and realistic from the viewpoint of visual perception and will find many potential applications in computer graphics and 3D imaging.
Optimal consensus set and preimage of 4-connected circles in a noisy environment
This paper exploits the problem of fitting special forms of annuli that correspond to 4-connected digital circles to a given set of points in 2D images in the presence of noise by maximizing the
On the Characterization of Absentee-Voxels in a Spherical Surface and Volume of Revolution in $${\mathbb Z}^3$$Z3
A characterization of the absentee-voxels using certain techniques of digital geometry and it is shown that their count varies quadratically with the radius of the semi-circular generatrix and how the proposed technique for absentee-filling can be used to generate a variety of digital surfaces of revolution.


The Discrete Analytical Hyperspheres
An analytical definition of a discrete hypersphere with arbitrary center, radius, and thickness in dimension n is introduced and is called a discrete analytical hypersPhere.
Discrete circles: an arithmetical approach with non-constant thickness
An arithmetical definition of discrete circles with a non-constant thickness is introduced and it results in the characterization of regular discrete circle with integer parameters as well as J. Bresenham's circles.
Digital circles with non-lattice point centers
  • S. Pham
  • Mathematics
    The Visual Computer
  • 2005
The term “closest pixels” is defined and an algorithm to digitize an arbitrary circle, i.e., one whose radius is not necessarily an integer, and whose center is not always a lattice point, is provided.
Best approximate circles on integer grids
Simple, efficient, all-integer algorithms for drawing circles and arcs with approximately known endpoints with approximatelyknown endpoints follow from the analysis.
Computer Processing of Line-Drawing Images
Various forms of line drawing representation are described, different schemes of quantization are compared, and the manner in which a line drawing can be extracted from a tracing or a photographic image is reviewed.
Digital Straight Line Segments
It is shown that a digital arc S is the digitization of a straight line segment if and only if it has the "chord property:" the line segment joining any two points of S lies everywhere within
A Linear Algorithm for Segmentation of Digital Curves
A new very efficient linear algorithm for the segmentation of 8-connected digital curves is given using a definition of digital lines using a linear double diophantine inequality.
Géométrie discrète, calcul en nombres entiers et algorithmique
Un tres grand nombres de domaines, tant en Mathematique qu'en Physique, soient concernes il nous a semble clair that l'informatique, autre source of problemes discret-continu importants, pouvait offrir un champ d'experimentation a ces idees.
Algorithm for computer control of a digital plotter
An algorithm is given for computer control of a digital plotter. The algorithm may be programmed without multiplication or division instructions and is efficient with respect to speed of execution
Discrete Analytical Hyperplanes
The main result is the links made between the arithmetical thickness of a hyperplane and its topology.