Algorithms for 2D Line Clipping

Simple item page
dc.contributor.authorSkala, Vaclaven_US
dc.date.accessioned2015-10-05T07:56:09Z
dc.date.available2015-10-05T07:56:09Z
dc.date.issued1989en_US
dc.description.abstractNew 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.description.seriesinformationEG 1989-Technical Papersen_US
dc.identifier.doi10.2312/egtp.19891026en_US
dc.identifier.issn1017-4656en_US
dc.identifier.urihttps://doi.org/10.2312/egtp.19891026en_US
dc.publisherEurographics Associationen_US
dc.titleAlgorithms for 2D Line Clippingen_US
Files
Collections
EG1989 Proceedings (Technical Papers)
EG1989 Proceedings (Technical Papers)