Now showing items 1-2 of 2
Analysis of the n-dimensional quadtree decomposition for arbitrary hyper-rectangles
We give a closed-form expression for the average number of n- dimensional quadtree nodes (ieces' or locks') required by an n-dimensional hyper-rectangle aligned with the axes. Our formula includes as special cases the ...
Experimenting with Pattern Matching Algorithms
Two new pattern matching algorithms based on the Boyer-Moore algorithm are presented. Their performance is compared to that of earlier relevant variants in terms of the number of character comparisons and the required ...