A cache-oblivious polygon indecomposability testing of convex polygons - by Rawan Nabil Soudah

Abstract

Cache-oblivious algorithm design has been growing due to many successful researc h efforts in this emerging field. Next to the theoretical implications of reason ing within this model, one needs to address the usefulness of cache oblivious al gorithms in