OPTIMAL PARALLEL PREPROCESSING ALGORITHMS FOR TESTING WEAK VISIBILITY OF POLYGONS FROM SEGMENTS

For an n-gon P, we say P is weakly visible from segment s if any point on P is visible from at least one point of the segment. In this paper, we present an optimal preprocessing algorithm which runs in O(logn) time using O(n) processors under the concurrent read exclusive write parallel random acces...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Parallel algorithms and applications Ročník 1; číslo 2; s. 83 - 98
Hlavní autoři:	HSU, F. R., CHANG, R. C., LEE, R. C. T.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Taylor & Francis Group 01.01.1993
Témata:	computational geometry CREW Parallel algorithm polygon visibility
ISSN:	1063-7192
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	For an n-gon P, we say P is weakly visible from segment s if any point on P is visible from at least one point of the segment. In this paper, we present an optimal preprocessing algorithm which runs in O(logn) time using O(n) processors under the concurrent read exclusive write parallel random access machine model such that after preprocessing, it takes O(logn) time to test if P is weakly visible from a given segment using a single processor.
ISSN:	1063-7192
DOI:	10.1080/10637199308915433