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 …

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 …

We present a new plane-probing algorithm, ie, an algorithm that computes the normal vector
of a digital plane from a starting point and a predicate “Is a point x in the digital plane?”. This …

Le monde numérique est parsemé de structures mathématiques discrètes, destinées à être
facilement manipulables par un ordinateur tout en donnant à notre cerveau l'impression …

Discrete 3D volumes come from various sources, including image segmentation, numerical
simulation, and voxel-based editors. Our focus is on processing the geometries of 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 …

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 …