- Applied mathematics
- >
- Theoretical computer science
- >
- Algorithms
- >
- Line clipping algorithms

- Fields of mathematics
- >
- Applied mathematics
- >
- Algorithms
- >
- Line clipping algorithms

- Fields of mathematics
- >
- Mathematical logic
- >
- Algorithms
- >
- Line clipping algorithms

- Geometric algorithms
- >
- Computer graphics algorithms
- >
- Clipping (computer graphics)
- >
- Line clipping algorithms

- Philosophy of mathematics
- >
- Mathematical logic
- >
- Algorithms
- >
- Line clipping algorithms

Nicholl–Lee–Nicholl algorithm

In computer graphics, the Nicholl–Lee–Nicholl algorithm is a fast algorithm for line clipping that reduces the chances of clipping a single line segment multiple times, as may happen in the Cohen–Suth

Cohen–Sutherland algorithm

In computer graphics, the Cohen–Sutherland algorithm is an algorithm used for line clipping. The algorithm divides a two-dimensional space into 9 regions and then efficiently determines the lines and

Cyrus–Beck algorithm

In computer graphics, the Cyrus–Beck algorithm is a generalized algorithm for line clipping. It was designed to be more efficient than the Cohen–Sutherland algorithm, which uses repetitive clipping. C

© 2023 Useful Links.