An optimal parallel algorithm for the visibility of a simple polygon from a point-Reference-Cited by-同舟云学术

An optimal parallel algorithm for the visibility of a simple polygon from a point

Published:1991-07 Issue:3 Volume:38 Page:515-532
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Atallah Mikhail J.¹,Wagener Hubert²,Chen Danny Z.¹

Affiliation:

1. Purdue Univ., West Lafayette, IN

2. Technische Univ., Berlin, Germany

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Reference15 articles.

1. Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms

2. AHO A. V. HOPCROFT J. E. AND ULLMAN J D. Algorithms. Addison-Wesley Reading Mass. 1974. The Design and Analysis of Computer AHO A. V. HOPCROFT J. E. AND ULLMAN J D. Algorithms. Addison-Wesley Reading Mass. 1974. The Design and Analysis of Computer

3. Parallel Merge Sort

4. Intersection of convex objects in two and three dimensions

Cited by 16 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An eikonal equation based path planning method using polygon decomposition and curve evolution;Defence Technology;2020-10

2. Computing $$L_1$$ Shortest Paths Among Polygonal Obstacles in the Plane;Algorithmica;2019-01-08

3. Computing the Visibility Polygon of an Island in a Polygonal Domain;Algorithmica;2015-08-29

4. GPU-based parallel algorithm for computing point visibility inside simple polygons;Computers & Graphics;2015-06

5. Computing the Visibility Polygon of an Island in a Polygonal Domain;Automata, Languages, and Programming;2012