Faster algorithm for line clipping against a pyramid in E³

• Autorzy: Skala V. , Bui D. H.
• Języki publikacji: EN

Abstrakty

EN

A new algorithm for line clipping against a pyramid in E³ is presented. The suggested algorithm is based on the use of a separation function and avoids conmputation of intersection points that are not endpoints of the output line segment. It also allows to solved all cases more effictively. The performance of this algorithm is shown to be consistently better than the traditional Liang-Barsky's algorithm for line clipping in E³. Experimental are also presented.

Słowa kluczowe

EN

line clipping; computer graphics; algorithm complexity; geometric algorithms; algorithm complexity analysis; ray tracing

• Wydawca: Institute of Information Technology of the Warsaw University of Life Sciences – SGGW
• Czasopismo: Machine Graphics and Vision
• Rocznik: 2000
• Tom: Vol. 9, No. 4
• Strony: 841--850
• Opis fizyczny: Bibliogr. 8 poz.

Twórcy

autor

Skala V.

autor

Bui D. H.

• Departament of Informatics and Computer Science, University of West Bohemia, Univerzitni 22, Box 314 306 14 Plzen, Czech Republic,