Robust Line-Convex Polygon Intersection Computation in E2 using Projective Space Representation

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F23%3A43976658" target="_blank" >RIV/49777513:23520/23:43976658 - isvavai.cz</a>
Result on the web
<a href="https://mgv.sggw.edu.pl/article/view/5208/8701" target="_blank" >https://mgv.sggw.edu.pl/article/view/5208/8701</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.22630/MGV.2023.32.3.1" target="_blank" >10.22630/MGV.2023.32.3.1</a>

Result language
angličtina
Original language name
Robust Line-Convex Polygon Intersection Computation in E2 using Projective Space Representation
Original language description
This paper describes modified robust algorithms for a line clipping by a convex polygon inE2and a convex polyhedron inE3. The proposed algorithm is based on the Cyrus-Beck algorithmand uses homogeneous coordinates to increase the robustness of computation. The algorithm enablescomputation fully in the projective space using the homogeneous coordinates and the line can be givenin the projective space, in general. If the result can remain in projective space, no division operation isneeded. It supports the use of vector-vector operations, SSE/AVX instructions, and GPU.
Czech name
—
Czech description
—

Type
J<sub>SC</sub> - Article in a specialist periodical, which is included in the SCOPUS database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2023
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)