Last monday 25th January, our mate Guillermo Aparicio defended his PhD thesis entitled Bisección iterativa de un simplex regular: Paralelización. It is the result of his research along his period as a PhD student.
It studies and analizes some key aspects regarding bisection by the longest side of a regular simplex. Algorithm which study simplices shapes in the binary search tree was developed, getting a sequence of division that allow to generate the minimum tree.
This thesis is available in the thesis section to everyone who is interested at it.