Vol. 5 (01) pp. 2377-2379 DOI: 10.21474/IJAR01/3022

A REVIEW: COMPARISON OF LINE CLIPPING ALGORITHMS IN 3D SPACE.

68 Downloads 247 Views
Crossref

Download Full Paper (PDF)

Abstract

In computer graphics there are many line clipping algorithms which can be extended to 3D space. This paper is a review on Cohen-Sutherland and Liang-Barsky line clipping algorithms. Mostly all of the 3D line clipping algorithms involves basic three steps to check either a line segment lies completely inside the clipping volume or lies completely outside the clipping volume or crossing calculations when it is not entirely inside or outside. [1]

Keywords

Article Analytics

How to Cite This Article

Nisha. (2017); A REVIEW: COMPARISON OF LINE CLIPPING ALGORITHMS IN 3D SPACE., Int. J. of Adv. Res., 5 (01), 2377-2379, ISSN 2320-5407. DOI: https://doi.org/10.21474/IJAR01/3022

Corresponding Author

Nisha

Creative Commons Attribution 4.0 This work is licensed under a Creative Commons Attribution 4.0 International License.