FAQ

Line clipping

Known as: Fast clipping, Fast-Clipping 
In computer graphics, line clipping is the process of removing lines or portions of lines outside an area of interest. Typically, any line or part… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1975-2014
02419752014

Related topics

Related topics

4 relations
Clipping (computer graphics)Computer graphicsCyrus–Beck algorithmList of algorithms

Related mentions per year

Related mentions per year

1959-2018
1960198020002020
Line clipping
Computer graphics
List of algorithms
Clipping (computer graphics)
Cyrus–Beck algorithm

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
An Efficient Line Clipping Algorithm for 3D Space
This paper proposes a new line clipping algorithm for 3D space against a cuboid which is not generated based on CohenSutherland… (More)
  • figure 9
  • table I
Is this relevant?
2012
2012
An Alternative Algorithm for Line Clipping
The development, testing, and validation of the Nicholl-Lee-Nicholl algorithm are difficult, and when it is extended to 3D, the… (More)
  • figure 1
Is this relevant?
2009
2009
A Novel Algorithm for Line Clipping
A new algorithm for clipping a line segment in two dimension against a rectangular window is presented in this paper . The… (More)
  • table 1
Is this relevant?
2004
2004
A new line clipping algorithm with hardware acceleration
  • Václav Skala
  • Proceedings Computer Graphics International, 2004…
  • 2004
Algorithms for line clipping against convex polygon have been studied for a long time and many research papers have been… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
Is this relevant?
2002
2002
An efficient line clipping algorithm based on adaptive line rejection
Line clipping process often involves a lot of intersection calculations. One way for improving the efficiency of a line clipping… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1996
1996
Line clipping in E2 with O(1) processing complexity
A new algorithm for line clipping by convex polygon with O( ) 1 processing complexity is presented. It is based on dual space… (More)
  • table 1.1
  • figure 2.1
  • figure 3.1
  • table 6.2
  • figure 6.1
Is this relevant?
1994
1994
O(lgN) Line Clipping Algorithm in E2
A new O N (lg ) line clipping algorithm in E against a convex window is presented. The main advantage of the presented algorithm… (More)
  • figure 3
  • table 2
  • table 3
Is this relevant?
1991
1991
New algorithm for two-dimensional line clipping
-Line segment clipping is a basic element of the visualization process in a graphics system. So far there exist two approaches… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1987
1987
A fast two-dimensional line clipping algorithm via line encoding
-Clipping of lines is an important operation in most graphics applications. Two main types of line clipping algorithms have been… (More)
  • figure 3
  • table 1
  • table 2
  • table 3
  • table 5
Is this relevant?
1984
1984
A New Concept and Method for Line Clipping
A new concept and method for line clipping is developed that describes clipping in an exact and mathematical form. The basic… (More)
  • figure I
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?