Název:	Algorithms to test ray-triangle intersection. comparativestudy
Autoři:	Segura, Rafael J. Feito, Francisco R.
Citace zdrojového dokumentu:	Journal of WSCG. 2001, vol. 9, no. 1-3.
Datum vydání:	2001
Nakladatel:	Václav Skala - UNION Agency
Typ dokumentu:	článek article
URI:	http://hdl.handle.net/11025/15747 http://wscg.zcu.cz/wscg2001/WSCG2001_Program.htm
ISSN:	1213-6972 (print) 1213-6980 (CD-ROM) 1213-6964 (online)
Klíčová slova:	složitost algoritmu;počítačová grafika;optimální algoritmus;geometrické algoritmy
Klíčová slova v dalším jazyce:	algorithm complexity;computer graphics;optimal algorithm;geometric algorithms
Abstrakt v dalším jazyce:	In this article we present an algorithm to determine the intersection between rays and triangles based on the idea of the study of signs with respect to triangles. One of the advantages of this approach is its robustness due to its lack of trigonometric operations or complex divisions which might alter the result of the calculations. The algorithm is similar (or even better) in time to other existing algorithms, but it is based exclusively on the study of signs, so that the results obtained are more precise. A comparative study of times between the algorithm and other similar algorithms is presented.
Práva:	© Václav Skala - UNION Agency
Vyskytuje se v kolekcích:	Volume 9, number 1-3 (2001)

Všechny záznamy v DSpace jsou chráněny autorskými právy, všechna práva vyhrazena.