Digital planarity is defined by digitizing Euclidean planes in the three-dimensional digital
space of voxels; voxels are given either in the grid-point or the grid-cube model. The paper …

This paper proposes full convexity as an alternative definition of digital convexity, which is
valid in arbitrary dimension. It solves many problems related to its usual definitions, like …

This article presents a new method for fitting a digital line or plane to a given set of points in
a 2D or 3D image in the presence of noise by maximizing the number of inliers, namely the …

A new digital hyperplane recognition method is presented. This algorithm allows the
recognition of digital analytical hyperplanes, such as Naive, Standard and Supercover ones …

A digital plane is the set of integer points located between the parallel planes. We solve the
following problem: how to compute the exact normal vector of a digital plane given only a …

When processing the geometry of digital surfaces (boundaries of voxel sets), linear local
structures such as pieces of digital planes play an important role. To capture such …

We provide a new method to estimate the derivatives of a digital function by linear
programming or other geometrical algorithms. Knowing the digitization of a real continuous …

Digital planes are sets of integer points located between two parallel planes. We present a
new algorithm that computes the normal vector of a digital plane given only a predicate “is a …

Plane-probing algorithms have become fundamental tools to locally capture arithmetical and
geometrical properties of digital surfaces (boundaries of a connected set of voxels), and …

A plane-probing algorithm computes the normal vector of a digital plane from a starting point
and a predicate “Is a point xx in the digital plane?”. This predicate is used to probe the digital …