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

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 was implemented on array programming languages such as Matlab/Octave, Python.

Vectorized algorithms for regular tessellations of d-orthotopes and their faces by Cuvelier F. and Scarella G, december 6 2016, 35 pages, version 0.0.4. (1077 Ko)