 
Summary: Brief Supplement to the Manuscript on CacheOblivious
Polygon Indecomposability Testing.
Fatima K. Abu Salem
Computer Science Department, American University of Beirut
P.O. Box 110236, Riad El Solh Beirut 1107 2020
Lebanon
fatima.abusalem@aub.edu.lb
ABSTRACT
This technical report is an accompaniment to the paper in
[2]. Thus, all algorithms, theorems, propositions, ...etc ref
erenced below should be matched with the corresponding
ones in [2].
1. MEMORY PERFORMANCE ANALYSIS
OF ALG. 1 REVISITED
The following is a discussion how the two assumptions below
can be simulated for free in a strictly computational model
such as the RAM model.
Assumption 1. Given an arbitrary point in the plane, it
is assumed that the query whether or not this point belongs
