Rectangulating rectilinear polygons in parallel

  • Sung Kwon Kim
Session 2A: Computational Geometry
Part of the Lecture Notes in Computer Science book series (LNCS, volume 959)


In NC, one can decompose an n-vertex rectilinear polygon into O(n) rectangles, allowing Steiner points, so that any horizontal or vertical segment inside the polygon intersects O(logn) rectangles.


Short Path Decomposition Tree Steiner Point Vertical Segment Horizontal Edge 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    M.J. Atallah, R. Cole, and M.T. Goodrich, Cascading divide-and-conquer: A technique for designing parallel algorithms, SIAM J. Comput., 18 (1989) 499–532.CrossRefGoogle Scholar
  2. 2.
    B. Chazelle, H. Edelsbrunner, M. Grigni, L. Guibas, J. Hershberger, M. Sharir, and J. Snoeyink, Ray shooting in polygons using geodesic triangulations, Proc. 18th ICALP, Lecture Notes in Computer Science, vol. 510, pp. 661–673, 1991.Google Scholar
  3. 3.
    M. de Berg and M. van Kreveld, Rectilinear decompositions with low stabbing number, Information Processing Letters, 52 (1994) 215–221.CrossRefGoogle Scholar
  4. 4.
    J. Hershberger and S. Suri, A pedestrian approach to ray shooting: Shoot a ray, take a walk, Proc. 4th SODA, pp. 54–63, 1993.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Sung Kwon Kim
    • 1
  1. 1.Department of Computer ScienceKyungsung UniversityPusanKorea

Personalised recommendations