A New Fully Projective O(lg N) Line Convex Polygon Intersection Algorithm
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F25%3A43976558" target="_blank" >RIV/49777513:23520/25:43976558 - isvavai.cz</a>
Result on the web
<a href="https://link.springer.com/article/10.1007/s00371-024-03413-3" target="_blank" >https://link.springer.com/article/10.1007/s00371-024-03413-3</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s00371-024-03413-3" target="_blank" >10.1007/s00371-024-03413-3</a>
Alternative languages
Result language
angličtina
Original language name
A New Fully Projective O(lg N) Line Convex Polygon Intersection Algorithm
Original language description
Intersecting algorithms, especially line clipping in E2 and E3 in computer graphics, have been studied for a long time. Many different algorithms have been developed. The simplest case is a line clipping by a convex polygon in E2 with O(N) computational complexity and with known polygon edges orientation. This contribution presents a new algorithm for a line clipping by a convex polygon in E2 with O(lg N) complexity, which is based on the point-in-half plane test. The proposed algorithm does not require prior knowledge of the polygon edge orientation. The vertices of the convex polygon and the clipped line can be given in projective space using homogeneous coordinates. The algorithm uses vector–vector operations for efficient implementation with SSE or AVX vector–vector instructions or on GPUs.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2025
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
Name of the periodical
VISUAL COMPUTER
ISSN
0178-2789
e-ISSN
1432-2315
Volume of the periodical
41
Issue of the periodical within the volume
2
Country of publishing house
US - UNITED STATES
Number of pages
9
Pages from-to
1241-1249
UT code for WoS article
001242202400002
EID of the result in the Scopus database
—