Fast Algorithm for Polygon Clipping with 3D Windows

Simple item page
dc.contributor.authorBurkert, Andreasen_US
dc.contributor.authorNoll, Stefanen_US
dc.date.accessioned2015-10-05T07:55:49Z
dc.date.available2015-10-05T07:55:49Z
dc.date.issued1988en_US
dc.description.abstractMany applications which use 3D graphics, need 3D geometric modeling and hence polygon clipping against 3D Windows or general volumes. The disadvantages of existing clipping algorithms are that they are 2D, slow or produce incorrect results. This paper describes a new 3D clipping algorithm for concave polygons with one contour. The new algorithm is an extension to the algorithm of Liang and Barsky: The necessary condition for the appearance of a corner of the clipping rectangle in the output polygon is replaced by a necessary and sufficient condition and then extended to the three dimensional case. Another advantage of the presented algorithm is the the removal of degenerated edges. The algorithm is useful for implementing the draft international standards GKS-3D and PHIGS and also for 3D Window Systems.en_US
dc.description.seriesinformationEG 1988-Technical Papersen_US
dc.identifier.doi10.2312/egtp.19881032en_US
dc.identifier.issn1017-4656en_US
dc.identifier.urihttps://doi.org/10.2312/egtp.19881032en_US
dc.publisherEurographics Associationen_US
dc.titleFast Algorithm for Polygon Clipping with 3D Windowsen_US
Files
Collections
EG1988 Proceedings (Technical Papers)
EG1988 Proceedings (Technical Papers)