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 …

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 …

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 …

This paper proposes a new mathematical and computational tool for inferring the geometry
of shapes known only through approximations such as triangulated or digital surfaces. The …

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 …

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 …

We show that the plane-probing algorithms introduced in Lachaud et al.(J. Math. Imaging
Vis., 59, 1, 23–39, 2017), which compute the normal vector of a digital plane from a starting …

The classic problem of discrete structure recognition is revisited in this article. We focus on
naive digital straight segments (DSS) and, more generally, naive arithmetic hyperplanes …

On digital planes (set of integer points between two parallel Euclidean planes), plane-
probing algorithms initiate with a triangle, update one vertex at a time and approximate the …