The Community for Technology Leaders
Green Image
Issue No. 10 - October (1986 vol. 35)
ISSN: 0018-9340
pp: 923-928
E. Lodi , Department of Information Science, University of Pisa
We present a parallel algorithm to solve the visibility problem among n vertical segments in a plane, which can be implemented on a VLSI chip arranged as a mesh of trees. Our algorithm determines all the pairs of segments that "see" each other in time O(log n); while the fastest sequential algorithm requires O(n log n). A lower bound to the area-time complexity of this problem of O(n2 log2 n) is also derived.
VLSI, Area-time complexity, computational geometry, mesh of trees, parallel algorithm
E. Lodi, L. Pagli, "A VLSI Solution to the Vertical Segment Visibility Problem", IEEE Transactions on Computers, vol. 35, no. , pp. 923-928, October 1986, doi:10.1109/TC.1986.1676685
99 ms
(Ver 3.3 (11022016))