Optimal parallel algorithm for visibility of a simple polygon from a point

Authors:
M. J. Atallah;D. Z. Chen
Affiliations:
Purdue University;Purdue University
Venue:
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Year:
1989

Citing 6
Cited 3

Computational geometry: an introduction

Computational geometry: an introduction
Intersection of convex objects in two and three dimensions

Journal of the ACM (JACM)
Finding the convex hull of a sorted point set in parallel

Information Processing Letters
Parallel merge sort

SIAM Journal on Computing
Parallel Prefix Computation

Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms

Parallel methods for visibility and shortest path problems in simple polygons (preliminary version)

SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Gross motion planning—a survey

ACM Computing Surveys (CSUR)
Fast Motion Planning by Parallel Processing – a Review

Journal of Intelligent and Robotic Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a parallel algorithm for computing the visible portion of a simple polygonal chain with n vertices from a point in the plane. The algorithm runs in &Ogr;(log n) time using &Ogr;(n/ log n) processors in the CREW-PRAM computational model, and hence is asymptomatically optimal.