首页 | 本学科首页   官方微博 | 高级检索  
     


Fast algorithms for clipping lines and line segments in E2
Authors:Duc Huy Bui  Vaclav Skala
Affiliation:(1) Department of Informatics and Computer Science, University of West Bohemia, Univerzitni 22, Box 314, 306 14 Plzen, Czech Republic bui@kiv.zcu.cz http://herakles.zcu.cz/∼bui skala@kiv.zcu.cz http://herakles.zcu.cz/∼skala, XX
Abstract:E 2 are presented. The suggested algorithms are based on a technique of coding the line direction together with the end points of the clipped line segment. They solve all cases more effectively. The algorithms are convenient for clippings lines or line segments by rectangle. Theoretical considerations and experimental results are also presented.
Keywords::   Line clipping  Computer graphics  Algorithm complexity  Geometric algorithms  Algorithm complexity analysis
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号