Fast High-Dimensional Boxcounting with Ternary Search Trees
Christian Merkwirth, Maciej Ogorzaøek, Ulrich Parlitz · 2006
We present a fixed word-length adaption of the ternary search tree algorithm originally proposed by Sedgewick and Bentley that allows the fast computation of the boxcounting statistics in arbitrary high dimensions.