Abstract
Hidden line elimination is a well-known problem in computer graphics and many practical solutions have been proposed. Only recently the problem has been studied from a theoretical point of view, taking asymptotic worst-case time- and spacebounds into account. Here we study three special cases of increasing difficulty and generality of the hidden line elimination problem. Applying some methods from computational geometry these problems can be solved with better worst-case bounds than those of the best known algorithms for the general problem.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Bentley, J.L., Solutions to Klee's rectangle problems. Carnegie-Mellon University, Department of Computer Science, unpublished manuscript, 1977.
Bentley, J.L. and D. Wood, An optimal worst-case algorithm for reporting intersections of rectangles. IEEE Transactions on Computers C-29, 571–577, 1980.
Giloi, W., Interactive computer graphics. Prentice-Hall, Englewood Cliffs, N.J., 1978.
Güting, R.H., Stabbing c-oriented polygons. Information Processing Letters 16, 35–40, 1983.
Güting, R.H., Dynamic c-oriented polygonal intersection searching. Universität Dortmund, Abteilung Informatik, Report 175, 1984.
Güting, R.H. and Th. Ottmann, New algorithms for special cases of the hidden line elimination problem. Universität Dortmund, Abteilung Informatik, Report 184, 1984.
Nievergelt, J. and F.P. Preparata, Plane-sweep algorithms for intersecting geometric figures. Communications of the ACM 25, 739–747, 1982.
Nurmi, O., A fast line-sweep algorithm for hidden line elimination. Universität Karlsruhe, Institut für Angewandte Informatik und Formale Beschreibungsverfahren, Report 134, 1984, to appear in: BIT.
Ottmann, Th., P. Widmayer and D. Wood, A worst-case efficient algorithm for hidden line elimination. Universität Karlsruhe, Institut für Angewandte Informatik und Formale Beschreibungsverfahren, Report 119, 1982.
Schmitt, A., On the time and space complexity of certain exact hidden line algorithms. Universität Karlsruhe, Fakultät für Informatik, Report 24/81, 1981.
Shamos, M.I., Computational geometry. Yale University, Ph.D. Thesis, 1978.
Shamos, M.I. and D. Hoey, Geometric intersection problems. Proceedings of the 17th Annual IEEE Symposium on Foundations of Computer Science, 208–215, 1976.
Six, H.W. and D. Wood, Counting and reporting intersections of d-ranges. IEEE Transactions on Computers C-31, 181–187, 1982.
Sutherland, I.E., R.F. Sproull and R.A. Schumacker, A characterization of ten hidden-surface algorithms. Computing Surveys 6, 1–55, 1974.
Vaishnavi, V.K. and D. Wood, Rectilinear line segment intersection, layered segment trees and dynamization. Journal of Algorithms 2, 160–176, 1981.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Güting, R.H., Ottmann, T. (1984). New algorithms for special cases of the hidden line elimination problem. In: Mehlhorn, K. (eds) STACS 85. STACS 1985. Lecture Notes in Computer Science, vol 182. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024005
Download citation
DOI: https://doi.org/10.1007/BFb0024005
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13912-6
Online ISBN: 978-3-540-39136-4
eBook Packages: Springer Book Archive