A VLSI Solution to the Vertical Segment Visibility Problem

E. Lodi; L. Pagli

doi:10.1109/TC.1986.1676685

Publication
1986
Issue No. 10 - October
Abstract - A VLSI Solution to the Vertical Segment Visibility Problem

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/EndNote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by E. Lodi Articles by L. Pagli

A VLSI Solution to the Vertical Segment Visibility Problem

October 1986 (vol. 35 no. 10)

pp. 923-928

	ASCII Text	x
	E. Lodi, L. Pagli, "A VLSI Solution to the Vertical Segment Visibility Problem," IEEE Transactions on Computers, vol. 35, no. 10, pp. 923-928, October, 1986.

	BibTex	x
	@article{ 10.1109/TC.1986.1676685, author = {E. Lodi and L. Pagli}, title = {A VLSI Solution to the Vertical Segment Visibility Problem}, journal ={IEEE Transactions on Computers}, volume = {35}, number = {10}, issn = {0018-9340}, year = {1986}, pages = {923-928}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1986.1676685}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - JOUR JO - IEEE Transactions on Computers TI - A VLSI Solution to the Vertical Segment Visibility Problem IS - 10 SN - 0018-9340 SP923 EP928 EPD - 923-928 A1 - E. Lodi, A1 - L. Pagli, PY - 1986 KW - VLSI KW - Area-time complexity KW - computational geometry KW - mesh of trees KW - parallel algorithm VL - 35 JA - IEEE Transactions on Computers ER -

E. Lodi, Department of Information Science, University of Pisa

L. Pagli

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.1986.1676685

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.

Index Terms:

VLSI, Area-time complexity, computational geometry, mesh of trees, parallel algorithm

Citation:

E. Lodi, L. Pagli, "A VLSI Solution to the Vertical Segment Visibility Problem," IEEE Transactions on Computers, vol. 35, no. 10, pp. 923-928, Oct. 1986, doi:10.1109/TC.1986.1676685

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.