 |
Free and accessible knowledge |
Vectorized algorithms for regular tessellations of d-orthotopes and their faces
Abstract : 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.
Cited literature [11 references]
https://hal.archives-ouvertes.fr/hal-01638329
Contributor : Francois Cuvelier Connect in order to contact the contributor
Submitted on : Monday, November 20, 2017 - 10:04:40 AM
Last modification on : Tuesday, December 7, 2021 - 4:10:47 PM
Long-term archiving on: : Wednesday, February 21, 2018 - 12:36:49 PM
Contributor : Francois Cuvelier Connect in order to contact the contributor
Submitted on : Monday, November 20, 2017 - 10:04:40 AM
Last modification on : Tuesday, December 7, 2021 - 4:10:47 PM
Long-term archiving on: : Wednesday, February 21, 2018 - 12:36:49 PM
File
hypermesh.pdf
Files produced by the author(s)