A Comparison of a New O(1) and the Cyrus-Beck Line Clipping Algorithms in E2

Date issued

1996

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

A comparison of a new algorithm for line clipping in E2 for convex polygons with O(1) processing complexity and the Cyrus-Beck algorithm is presented. The algorithm is based on the dual space representation and a space subdivision technique. The algorithm demonstrates that preprocessing can be used to speed up line clipping significantly. Theoretical analysis and detailed experimental results are also presented.

Description

Subject(s)

ořezávání přímky, konvexní polygon, počítačová grafika, geometrické algoritmy

Citation

Compugraphics '96: Fifth International Conference on Computational Graphics and Visualization Techniques: Proceedings, p. 281-287.
OPEN License Selector