Algorithms for Line and Plane Intersection with a Convex Polyhderon with O (sqrt(N)) Expected Complexity in E3
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F14%3A43924228" target="_blank" >RIV/49777513:23520/14:43924228 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1145/2668975.2668976" target="_blank" >http://dx.doi.org/10.1145/2668975.2668976</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1145/2668975.2668976" target="_blank" >10.1145/2668975.2668976</a>
Alternative languages
Result language
angličtina
Original language name
Algorithms for Line and Plane Intersection with a Convex Polyhderon with O (sqrt(N)) Expected Complexity in E3
Original language description
A new algorithm for line-convex polyhedron and plane-convex polyhedron intersection with O(sqrt(N)) complexity is presented.
Czech name
—
Czech description
—
Classification
Type
O - Miscellaneous
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/LH12181" target="_blank" >LH12181: Development of Algorithms for Computer Graphics and CAD/CAM systems</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů