An empirical study of cache-oblivious polygon indecomposability testing
link.springer.com › Computing
Mar 24, 2010 · We implement and undertake an empirical study of the cache-oblivious variant of the polygon indecomposability testing algorithm of Gao and ...
We implement and undertake an empirical study of the cache-oblivious variant of the polygon indecomposability testing algorithm of Gao and Lauder.
An empirical study of the cache-oblivious variant of the polygon indecomposability testing algorithm of Gao and Lauder, based on a depth-first search (DFS) ...
Oct 22, 2024 · We implement and undertake an empirical study of the cache-oblivious variant in (2) of the polygon indecom- posability testing algorithm of ...
An empirical study of cache-oblivious polygon indecomposability ...
link.springer.com › content › pdf
Abstract We implement and undertake an empirical study of the cache-oblivious variant of the polygon indecomposability testing algorithm of Gao and Lauder, ...
Jul 21, 2010 · We examine a cache-oblivious reformulation of the (iterative) polygon indecomposability test of [19]. We analyse the cache complexity of the ...
An empirical study of cache-oblivious polygon indecomposability testing · Fatima K. Abu SalemRawan N. Soudah. Computer Science, Mathematics. Computing. 2010.
We analyse the cache complexity of the iterative version of this test within the ideal-cache model and identify the bottlenecks affecting its memory performance ...
Fatima K. Abu Salem, Rawan N. Soudah: An empirical study of cache-oblivious polygon indecomposability testing. Computing 88(1-2): 55-78 (2010).
We implement and undertake an empirical study of the cache-oblivious variant of the polygon indecomposability testing algorithm of Gao and Lauder, based on a ...