Showing papers by "Kamala Krithivasan published in 1996"
01 Jan 1996
TL;DR: This paper presents a O(log n) time algorithm using O(n 3 = log n) processors on an EREW PRAM, using the idea of parallel preex to achieve optimal speed-up over the best known sequential algorithm.
Abstract: For a given rectangle containing N points, an important problem is to nd the largest L-shaped polygon with sides parallel to those of the original rectangle, which contains none of the points. An L-shaped polygon is an orthogonal polygon with exactly one reeex angle. This paper presents a O(log n) time algorithm using O(n 3 = log n) processors on an EREW PRAM, using the idea of parallel preex. Herewith we achieve optimal speed-up over the best known sequential algorithm. We also present a O(logn) time algorithm on a mesh of trees architecture with O(n 3) processors.