Vectorized algorithms for regular tessellations of d-orthotopes and their faces
François Cuvelier, Gilles Scarella · HAL (Le Centre pour la Communication Scientifique Directe) · 2017
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.