A VLSI Solution to the Vertical Segment Visibility Problem

Authors:
E Lodi;L Pagli
Affiliations:
-;-
Venue:
IEEE Transactions on Computers
Year:
1986

Citing 3
Cited 4

Area-time complexity for VLSI

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Some complexity questions related to distributive computing(Preliminary Report)

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
New lower bound techniques for VLSI

SFCS '81 Proceedings of the 22nd Annual Symposium on Foundations of Computer Science

A Time- and Cost-Optimal Algorithm for Interlocking Sets-With Applications

IEEE Transactions on Parallel and Distributed Systems
Constant-Time Algorithms for Constrained Triangulations on Reconfigurable Meshes

IEEE Transactions on Parallel and Distributed Systems
Time-Optimal Visibility-Related Algorithms on Meshes with Multiple Broadcasting

IEEE Transactions on Parallel and Distributed Systems
Rectangle Visibility Graphs: Characterization, Construction, and Compaction

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science

Quantified Score

Hi-index	14.98

Visualization

Abstract

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.