Abstract
We consider the problem of finding the upper envelope layers of a set of line segments, sequentially and in parallel. The upper envelope of a set of n line segments in the plane can be computed in O(n log n) time [10]. By repeatedly removing the segments that appear on the envelope and recomputing the envelope, one obtains a natural partition of the set of segments into layers. We give an O(n log n) sequential algorithm to find envelope layers if the segments are disjoint and an O(na(n) log2 n) algorithm if the segments intersect (α(n) is the extremely slowly-growing inverse of Ackermann's function [9]). Finally, we prove that the problem of finding envelope layers in parallel is P-complete, and hence likely to be intractable.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
P. K. Agarwal. Ray shooting and other applications of spanning trees with low stabbing number. In Proceedings of the 5th ACM Symposium on Computational Geometry, pages 315–325, 1989.
Ta. Asano, Te. Asano, L. Guibas, J. Hershberger, and H. Imai. Visibility of disjoint polygons. Algorithmica, 1(1):49–63, 1986.
M. Atallah, P. Callahan, and M. Goodrich. P-complete geometric problems. In Proceedings of the 2nd ACM Symposium on Parallel Algorithms and Architectures, 1990.
B. Chazelle. On the convex layers of a planar set. IEEE Transactions on Information Theory, IT-31(4):509–517, July 1985.
B. Chazelle and L. Guibas. Visibility and intersection problems in plane geometry. In Proceedings of the ACM Symposium on Computational Geometry, pages 135–146, 1985.
H. Edelsbrunner. Algorithms in Combinatorial Geometry, volume 10 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1987.
R. Greenlaw, H. J. Hoover, and W. L. Ruzzo. A compendium of problems complete for P. Manuscript, 1989.
L. J. Guibas and F. F. Yao. On translating a set of rectangles. In Proceedings of the 12th ACM Symposium on Theory of Computing, pages 154–160, 1980.
S. Hart and M. Sharir. Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes. Combinatorica, 6:151–177, 1986.
J. Hershberger. Finding the upper envelope of n line segments in O(n log n) time. Information Processing Letters, 33:169–174, 1989.
J. Hershberger and S. Suri. Applications of a semi-dynamic convex hull algorithm. In Proceedings of the 2nd Scandinavian Workshop on Algorithm Theory. Springer-Verlag, 1990.
R. E. Ladner. The circuit value problem is log space complete for P. SIGACT News, 7(1):18–20, 1975.
Ian Parberry. Parallel Complexity Theory. Research Notes in Theoretical Computer Science. Pitman Publishing/John Wiley & Sons, 1987.
F. P. Preparata and M. I. Shamos. Computational Geometry. Springer Verlag, New York, 1985.
A. Wiernik and M. Sharir. Planar realization of nonlinear Davenport-Schinzel sequences by segments. Discrete and Computational Geometry, 3:15–47, 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hershberger, J. (1990). Upper envelope onion peeling. In: Gilbert, J.R., Karlsson, R. (eds) SWAT 90. SWAT 1990. Lecture Notes in Computer Science, vol 447. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52846-6_105
Download citation
DOI: https://doi.org/10.1007/3-540-52846-6_105
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52846-3
Online ISBN: 978-3-540-47164-6
eBook Packages: Springer Book Archive