Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
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.
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.
M. de Berg and M. van Kreveld, Rectilinear decompositions with low stabbing number, Information Processing Letters, 52 (1994) 215–221.
J. Hershberger and S. Suri, A pedestrian approach to ray shooting: Shoot a ray, take a walk, Proc. 4th SODA, pp. 54–63, 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, S.K. (1995). Rectangulating rectilinear polygons in parallel. In: Du, DZ., Li, M. (eds) Computing and Combinatorics. COCOON 1995. Lecture Notes in Computer Science, vol 959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030820
Download citation
DOI: https://doi.org/10.1007/BFb0030820
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60216-3
Online ISBN: 978-3-540-44733-7
eBook Packages: Springer Book Archive