New fast line clipping algorithm in E2 with O(IgN) complexity
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F99%3A00039297" target="_blank" >RIV/49777513:23520/99:00039297 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
New fast line clipping algorithm in E2 with O(IgN) complexity
Original language description
New faster line clipping algorithm in E2 against a convex polygon with O[1gN] complexity is presented. The advantage of the presented algorithm is the principal acceleration of the line clipping problem solution. A comparison of and experimental resultsfor selected known algorithms are also shown.
Czech name
—
Czech description
—
Classification
Type
C - Chapter in a specialist book
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
1999
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Book/collection name
New fast line clipping algorithm in E2 with O(IgN) complexity
ISBN
8022313572
Number of pages of the result
8
Pages from-to
—
Number of pages of the book
—
Publisher name
Comenius University
Place of publication
Bratislava
UT code for WoS chapter
—