Two new algorithms for line clipping in E² and their comparison

• Autorzy: Skala V. , Hui B. D.
• Konferencja: Conference on Computer Graphics and Image Processing, GKPO' 2000 (6 ; 15-19.05.2000 ; Polesie, Poland)
• Języki publikacji: EN

Abstrakty

EN

New efficient algorithms for the line clipping by the given rectangle in E² are presented. The first algoritm is based on the line direction evaluation the second one is based on a new coding technique of clipping rectangle's vertices. It allows solving all cases more effectively. A comparison of the proposed algorithms with the Liang-Barsky algorithm and some experimental results are presented, too.

Słowa kluczowe

EN

line clipping; computer graphics; algoritm complexity; geometric algorithms; algoritm complexity analysis

• Wydawca: Institute of Information Technology of the Warsaw University of Life Sciences – SGGW
• Czasopismo: Machine Graphics and Vision
• Rocznik: 2000
• Tom: Vol. 9, No. 1/2
• Strony: 297--306
• Opis fizyczny: Bibliogr. 9 poz.

Twórcy

autor

Skala V.

autor

Hui B. D.

• Department of Informatics and Computer Science. The Univercity of West Bohemia. Univerzitni 8, Box 314, 306 14 Plzen, Czech Republic