Journal of the ACM Bibliography

Mikhail J. Atallah, Danny Z. Chen, and Hubert Wagener. An optimal parallel algorithm for the visibility of a simple polygon from a point. Journal of the ACM, 38(3):516-533, July 1991. [BibTeX entry]
Categories and Subject Descriptors: F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems -- computations on discrete structures, geometrical problems and computations; I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling -- geometrical algorithms

General Terms: Algorithms, Theory

Additional Key Words and Phrases: Computational geometry, intersections of polygonal chains, parallel computational complexity, simple polygons, visible regions

Selected papers that cite this one

Selected references


Shortcuts:

  • Journal of the ACM homepage
  • Bibliography top level
  • Journal of the ACM Author Index
  • Search the HBP database