A Comparison of 2D Line Clipping Algorithms

Date issued

1995

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

A comparative study of new line clipping algorithms for 2D complex polygons is presented and the evaluation of algorithms' efficiency based on theoretical analysis and experimental results is given. Complexity of all compared algorithms is O(N).

Description

Subject(s)

ořezávání přímky, konvexní polygon, algoritmy duálního prostoru, počítačová grafika

Citation

Machine Graphics and Vision. 1995, vol. 3, no. 4, p. 625-633.

Collections

OPEN License Selector