M. J. Atallah and J. -J. Tsay,, "On the Parallel- Decomposability of Geometric Problelns," Algorith- mica 8 (1992), 209 231.  Home/Search   Document Not in Database   Summary   Related Articles

....it finds with the best solution from any higher level. As we scan, we maintain an active set Ai for each strip 7i. Ai is the set of points in 7i for which we do not yet have either a certificate or a definite answer as to the identity of FN(p) The following lemma, due to Atallah and Tsay [5] bounds the size of Ai. Lemma 2.1 [5] At all times during the sweep, A[ 4 for all 7. Although there can be no more than a constant number (4) of points in Ai at a time, these are not re quired to be the last four points in 7i that the sweep line passed. Nevertheless, since there are only a ....

....from any higher level. As we scan, we maintain an active set Ai for each strip 7i. Ai is the set of points in 7i for which we do not yet have either a certificate or a definite answer as to the identity of FN(p) The following lemma, due to Atallah and Tsay [5] bounds the size of Ai. Lemma 2. 1 [5]: At all times during the sweep, A[ 4 for all 7. Although there can be no more than a constant number (4) of points in Ai at a time, these are not re quired to be the last four points in 7i that the sweep line passed. Nevertheless, since there are only a constant number, we can keep the four ....

[Article contains additional citation context not shown here]

M. J. Atallah and J. -J. Tsay,, "On the Parallel- Decomposability of Geometric Problelns," Algorith- mica 8 (1992), 209 231.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC