A fast line-sweep algorithm for hidden line elimination
- 1 September 1985
- journal article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 25 (3) , 466-472
- https://doi.org/10.1007/bf01935366
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Solving visibility problems by using skeleton structuresPublished by Springer Nature ,2006
- A visible polygon reconstruction algorithmACM SIGGRAPH Computer Graphics, 1981
- Comments on “algorithms for reporting and counting geometric intersections”IEEE Transactions on Computers, 1981
- 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
- Raster-scan hidden surface algorithm techniquesACM SIGGRAPH Computer Graphics, 1977