A Brief Survey of Clipping and Intersection Algorithms with a List of References (including Triangle-triangle Intersection)

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F23%3A43968464" target="_blank" >RIV/49777513:23520/23:43968464 - isvavai.cz</a>
Result on the web
<a href="https://informatica.vu.lt/journal/INFORMATICA/article/1283/text" target="_blank" >https://informatica.vu.lt/journal/INFORMATICA/article/1283/text</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.15388/23-INFOR508" target="_blank" >10.15388/23-INFOR508</a>

Result language
angličtina
Original language name
A Brief Survey of Clipping and Intersection Algorithms with a List of References (including Triangle-triangle Intersection)
Original language description
This contribution presents a brief survey of clipping and intersection algorithms in E2 and E3 with a nearly complete list of relevant references. Some algorithms use the projective extension of the Euclidean space and vector-vector operations, which support GPU and SSE use.This survey is intended to help researchers, students, and practitioners dealing with intersection and clipping algorithms.
Czech name
—
Czech description
—

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)

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)