Abstract
The kernel of a polygon P is the set of all points that see the interior of P. It can be computed as the intersection of the halfplanes that are to the left of the edges of P. We present an O(log log n) time CRCW-PRAM algorithm using n/log log n processors to compute a representation of the kernel of P that allows to answer point containment and line intersection queries efficiently. Our approach is based on computing a subsequence of the edges that are sorted by slope and contain the “relevant” edges for the kernel computation.
This work was supported under a Deutsche Forschungsgemeinschaft Grant, Project “Datenstrukturen”, Ot 64/5-4.
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 and D. Z. Chen. Optimal parallel algorithm for visibility of a simple polygon from a point. In Proc. 5th ACM Symp. on Computational Geometry, pages 114–123, 1989.
O. Berkman, B. Schieber, and U. Vishkin. Some Doubly Logarithmic Optimal Parallel Algorithms Based on Finding All Nearest Smaller Values. Technical Report UMIACS-TR-88-79, Institute for Advance Computer Studies, University of Maryland, 1988.
D. Z. Chen. An optimal parallel algorithm for detecting weak visibility of a simple polygon. In Proc. 8th ACM Symp. on Computational Geometry, pages 63–72, 1992.
R. Cole and M. Goodrich. Optimal parallel algorithms for polygon and point-set problems. In Proc. 4th ACM Symp. on Computational Geometry, pages 201–210, 1988.
Herbert Edelsbrunner. Algorithms in Combinatorial Geometry. Springer Verlag, EATCS monographs on theoretical computer science, 1987.
D. T. Lee and F. P. Preparata. An optimal algorithm for finding the kernel of a polygon. Journal of the ACM, 26(3):415–421, July 1979.
P. Ragde. The parallel simplicity of compaction and chaining. In Proc. 17th Intern. Colloq. on Automata, Languages, and Programming, pages 744–751, 1990.
H. Wagener. Optimal parallel hull construction for simple polygons in O(log log n) time. In Proc. 33rd IEEE Symp. on Foundations of Computer Science, pages 593–599, 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schuierer, S. (1994). An O(log log n) algorithm to compute the kernel of a polygon. In: Schmidt, E.M., Skyum, S. (eds) Algorithm Theory — SWAT '94. SWAT 1994. Lecture Notes in Computer Science, vol 824. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58218-5_29
Download citation
DOI: https://doi.org/10.1007/3-540-58218-5_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58218-2
Online ISBN: 978-3-540-48577-3
eBook Packages: Springer Book Archive