Algorithms for 2D Line Clipping

dc.contributor.author	Skala, Vaclav	en_US
dc.date.accessioned	2015-10-05T07:56:09Z
dc.date.available	2015-10-05T07:56:09Z
dc.date.issued	1989	en_US
dc.identifier.issn	1017-4656	en_US
dc.identifier.uri	http://dx.doi.org/10.2312/egtp.19891026	en_US
dc.description.abstract	New algorithms for 2D line clipping against convex, non-convex windows and windows that consist of linear edges and arcs are being presented. Algorithms were derived from the Cohen-Sutherland 's and Liang-Barsky s algorithms. The general algorithm with linear edges and arcs can be used especially for engineering drafting systems. Algorithms are easy to modify in order to deal with holes too. The presented algorithms have been verified in TURBO-PASCAL. Because of the unifying approach to the clipping problem solution all algorithms are simple, easy to understand and implement.	en_US
dc.publisher	Eurographics Association	en_US
dc.title	Algorithms for 2D Line Clipping	en_US
dc.description.seriesinformation	EG 1989-Technical Papers	en_US
dc.identifier.doi	10.2312/egtp.19891026	en_US