Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/99374
Title: Parallel algorithm for segment visibility reporting
Authors: Chan, I.W. 
Friesen, D.K.
Keywords: EREW PRAM
Parallel algorithm
segment visibility
Issue Date: Sep-1993
Source: Chan, I.W.,Friesen, D.K. (1993-09). Parallel algorithm for segment visibility reporting. Parallel Computing 19 (9) : 973-978. ScholarBank@NUS Repository.
Abstract: In this paper, we present a parallel algorithm for solving the all-pairs vertical segment visibility reporting (SVR) problem. Given a set S = {S0, S1, ..., Sn-1} of disjoint vertical segments in the plane, the SVR problem asks for the determination and reporting of all the distinct visibility pairs. Our algorithm solves the SVR problem in O(log n) time using O(n log n) space and O(n) processors on an EREW PRAM Exclusive Write Parallel Random Access Machine) computational model. © 1993.
Source Title: Parallel Computing
URI: http://scholarbank.nus.edu.sg/handle/10635/99374
ISSN: 01678191
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

15
checked on Jan 11, 2018

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.