Vectorized algorithms for regular tessellations of d-orthotopes and their faces

François Cuvelier (1) , Gilles Scarella (2)

1 LAGA - Laboratoire Analyse, Géométrie et Applications
2 LJAD - Laboratoire Jean Alexandre Dieudonné

Tessellation of hypercubes or orthotopes and all their faces in any dimension is a nice challenge. The purpose of this paper is to describe efficient vectorized algorithms to obtain regular tessellations made up by simplices or orthotopes. These vectorized algorithms have been implemented in array programming languages such as Matlab/Octave, Python.

Domaines: Analyse numérique [math.NA]

François Cuvelier, Gilles Scarella. Vectorized algorithms for regular tessellations of d-orthotopes and their faces. 2018. ⟨hal-01638329v2⟩