"A new algorithm for clipping a line segment against a pyramid in E3 is presented. This algorithm avoids computation of intersection points that are not end points of the outputline segment. It also solves all cases more effectively. The performance of this algorithmis shown to be consistently better than that of existing algorithms, including the Cohen-Sutherland, Liang-Barsky, and Cyrus-Beck algorithms." . "2"^^ . . "RIV/49777513:23520/01:00065368!RIV/2002/AV0/235202/N" . "The Visual Computer" . "0178-2789" . . . . . "680101" . "Vol. 17" . "Bui, Duc Huy" . "23520" . "Bui, Duc Huy" . "Skala, V\u00E1clav" . . "Extension of the Nicholls-Lee-Nichols algorithm to three dimensions"@en . "RIV/49777513:23520/01:00065368" . . "7"^^ . "Extension of the Nicholls-Lee-Nichols algorithm to three dimensions"@en . . . . "Extension of the Nicholls-Lee-Nichols algorithm to three dimensions" . . . . "[7310AA4B63AA]" . . "Extension of the Nicholls-Lee-Nichols algorithm to three dimensions" . "s. 236-242" . "Line clipping; Computer graphics; Algorithm complexity; Geometric algorithms; Algorithm complex"@en . . "P(IAA2030801), P(VS97155)" . . . "0"^^ . "0"^^ . "2"^^ . "A new algorithm for clipping a line segment against a pyramid in E3 is presented. This algorithm avoids computation of intersection points that are not end points of the outputline segment. It also solves all cases more effectively. The performance of this algorithmis shown to be consistently better than that of existing algorithms, including the Cohen-Sutherland, Liang-Barsky, and Cyrus-Beck algorithms."@en . . "DE - Spolkov\u00E1 republika N\u011Bmecko" . "leden" .