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
- Vijay Chandru, Subir Kumar Ghosh, Anil Maheshwari, V. T. Rajan, and Sanjeev Saluja. NC-algorithms for minimum link path and related problems. Journal of Algorithms, 19(2):173-203, September 1995.
- S. Schuierer. An O(log log n) time algorithm to compute the kernel of a polygon. Nordic Journal of Computing, 1(4):458-474, Winter 1994.
Selected references
- B. Chazelle and D. P. Dobkin. Intersection of convex objects in two and three dimensions. Journal of the ACM, 34(1):1-27, January 1987.
- Richard E. Ladner and Michael J. Fischer. Parallel prefix computation. Journal of the ACM, 27(4):831-838, October 1980.