Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,209,448 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
4 relations
Clipping (computer graphics)
Computer graphics
Cyrus–Beck algorithm
List of algorithms
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
O clipping utilizado como ferramenta de mensuração do aproveitamento dos releases produzidos no Setor de Comunicação Integrada da UNESC
L. A. D. Silva
2016
Corpus ID: 193905065
2011
2011
Fast and Memory Efficient GPU-Based Rendering of Tensor Data
M. Hlawitschka
,
Sebastian Eichelbaum
,
G. Scheuermann
2011
Corpus ID: 156053980
Graphics hardware is advancing very fast and offers new possibilities to programmers. The new features can be used in scientific…
Expand
2010
2010
The Line Clipping Algorithm Basing on Affine Transformation
W. Huang
Intelligent Information Management
2010
Corpus ID: 15394455
A new algorithm for clipping line segments by a rectangular window on rectangular coordinate system is presented in this paper…
Expand
2008
2008
Improving Kd-tree quality at a reasonable construction cost
Alexei Soupikov
,
M. Shevtsov
,
A. Kapustin
IEEE Symposium on Interactive Ray Tracing
2008
Corpus ID: 19812286
We consider construction of high-quality kd-tree and investigate the effect of techniques based on perfect splits. The main idea…
Expand
2003
2003
A New Algorithm of Line Clipping for Convex Polygons
Sun Xie-hua
2003
Corpus ID: 123517729
A new algorithm of line clipping for convex polygons with n edges is proposed. Comparing the new algorithm and Cyrus-Beck…
Expand
2002
2002
A fast clipping algorithm of polygon
Kang W. Bao
2002
Corpus ID: 63328615
Based on the scanline algorithm, a fast clipping algorithm of polygon is presented. Compared to the existing clipping algorithm…
Expand
1999
1999
AN EFFICIENT ALGORITHM FOR THE LINE CLIPPING AGAINST A POLYGON
Liu Yong
1999
Corpus ID: 63211528
Existing line clipping algorithms are all offered based on a rectangular window or a convex polygonal window. No algorithm for…
Expand
Review
1996
Review
1996
Improving B'ezier Clipping and Chebyshev Boxing for Ray Tracing Parametric Surfaces
Swen Campagna
,
P. Slusallek
,
Ix Immd
1996
Corpus ID: 15804456
Ray tracing is a well known rendering technique for producing high quality photorealistic pictures. Parametric surfaces are being…
Expand
1993
1993
METAMORPHOSIS USING B EZIER CLIPPING
T. Nishita
,
T. Fujii
1993
Corpus ID: 13611622
Recently, in the eld of entertainment, the metamorphosis of 2-D images, as it is an attractive technique, has come to be used in…
Expand
1992
1992
The Optimal Tree Algorithm for Line Clipping
B. Barsky
,
You-Dong Liang
1992
Corpus ID: 59816529
This paper develops a new algorithm for line clipping based on the concept of the optimal tree. A careful analysis results in an…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE