31Jan 2017

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

Crossref Cited-by Linking logo
  • Abstract
  • Keywords
  • Cite This Article as
  • Corresponding Author

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]

[Nisha. (2017); A REVIEW: COMPARISON OF LINE CLIPPING ALGORITHMS IN 3D SPACE. Int. J. of Adv. Res. 5 (Jan). 2377-2379] (ISSN 2320-5407). www.journalijar.com

Nisha

DOI:

Article DOI: 10.21474/IJAR01/3022      
DOI URL: http://dx.doi.org/10.21474/IJAR01/3022

Download Full Paper

Download PDF No. of Downloads: 64 | No. of Views: 189