Detail publikace
Three stage object boundary intersection solver
JINDRA, P. ŠŤASTNÝ, J.
Anglický název
Three stage object boundary intersection solver
Typ
článek ve sborníku ve WoS nebo Scopus
Jazyk
en
Originální abstrakt
Detection of collisions is an important part of many applications which work with threedimensional graphics. When intersections of objects can be determined, significant computation time is saved because many computations do not have to be done. The algorithm described in this article cannot determine the intersection of real objects, but it can help to save CPU time by determining the intersection of object boundaries. The algorithm can be used in many engineering or graphical applications, such as improvement of semi-transparent object rendering or auxiliary collision detection in applications solving interactions of objects.
Anglický abstrakt
Detection of collisions is an important part of many applications which work with threedimensional graphics. When intersections of objects can be determined, significant computation time is saved because many computations do not have to be done. The algorithm described in this article cannot determine the intersection of real objects, but it can help to save CPU time by determining the intersection of object boundaries. The algorithm can be used in many engineering or graphical applications, such as improvement of semi-transparent object rendering or auxiliary collision detection in applications solving interactions of objects.
Klíčová slova anglicky
Graphics. multi thread programming. mesh objects. Computation. Algorithm. boundary intersection.
Vydáno
02.05.2018
Nakladatel
Wolters Kluwer
Místo
Prague
ISBN
978-80-7598-059-5
ISSN
2464-7470
Kniha
DIVAI 2018
Strany od–do
431–449
Počet stran
29
BIBTEX
@inproceedings{BUT151297,
author="Petr {Jindra} and Jiří {Šťastný},
title="Three stage object boundary intersection solver ",
booktitle="DIVAI 2018",
year="2018",
month="May",
pages="431--449",
publisher="Wolters Kluwer",
address="Prague",
isbn="978-80-7598-059-5",
issn="2464-7470"
}