최적 윈도우를 이용한 클리핑 알고리즘

A clipping algorithm using the optimal window

The most attention-getting object in Computer Graphic is the clipping on Window, for it can make the shape of window a new shape and controllable environment. To utilize the functions of clipping for utmost conditions ,three methods can be considered : the first is to utilize the chracteristics of hardware, the second is to utilize those of the software and the third is the utilizing those hardware and software. This study suggests the way of solving the clipping problem by adapting the second method, that is, software using the optimal dynamic window, which is included the edges inside the new window. And to prove the effectivness of the algorithm already mentioned, I acted up it on IBM-PC with C-language . As a result of practice, the effectiveness of algorithm was prove to be much more excellent than the prsent methods.