Nicholl Lee Nicholl Line Clipping Algorithm - Dr P Asha
Автор: Sathyabama Institute of Science and Technology
Загружено: 2024-03-02
Просмотров: 5509
This video explains the Nicholl Lee Nicholl Line Clipping Algorithm with an example. This algorithm clips the portions of line which are outside the window and preserves the portion of line inside the window. Out of nine possible regions of a window, this method considers only three possible regions such as window region, Edge region and Corner region. If the endpoint lies in any of the other six regions, then employ symmetry transformation (Refection, Rotation) and move it to one of the three considered regions. Construct the window and plot the line that has to be clipped. Next draw the Half Infinite line(HL) for segregating the regions. Find the slope of the line segment and all HL’s and then compare the slopes for finding out where the line segment lies. Finally calculate the Intersection points and save the portion of line inside the window. This algorithm seems to be more efficient as it involves very fewer comparisons and divisions.
#sist #sathyabama #cse #computergraphics #nichollleenicholl #lineclipping #clippingalgorithm #nichollleenichollclippingexample #variouslineclippingalgorithms
Доступные форматы для скачивания:
Скачать видео mp4
-
Информация по загрузке:
