New algorithms for special cases of the hidden line elimination problem
- 30 November 1987
- journal article
- Published by Elsevier in Computer Vision, Graphics, and Image Processing
- Vol. 40 (2), 188-204
- https://doi.org/10.1016/s0734-189x(87)80114-7
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A fast line-sweep algorithm for hidden line eliminationBIT Numerical Mathematics, 1985
- A worst-case efficient algorithm for hidden-line elimination†International Journal of Computer Mathematics, 1985
- Dynamic C-oriented polygonal intersection searchingInformation and Control, 1984
- Plane-sweep algorithms for intersecting geometric figuresCommunications of the ACM, 1982
- Counting and Reporting Intersections of d-RangesIEEE Transactions on Computers, 1982
- An Optimal Worst Case Algorithm for Reporting Intersections of RectanglesIEEE Transactions on Computers, 1980
- Algorithms for Reporting and Counting Geometric IntersectionsIEEE Transactions on Computers, 1979
- A Characterization of Ten Hidden-Surface AlgorithmsACM Computing Surveys, 1974