Název:	Lower bound of distance in 3D
Autoři:	Konečný, Petr Zikan, Karel
Citace zdrojového dokumentu:	Journal of WSCG. 1997, vol. 5, no. 1-3, p. 1-16.
Datum vydání:	1997
Nakladatel:	Václav Skala - UNION Agency
Typ dokumentu:	článek article
URI:	http://hdl.handle.net/11025/15889 http://wscg.zcu.cz/wscg1997/wscg97.htm
ISSN:	1213-6972 (print) 1213-6980 (CD-ROM) 1213-6964 (online)
Klíčová slova:	detekce kolizí;výpočet dolní hranice vzdálenosti
Klíčová slova v dalším jazyce:	collision detection;compute lower bounds of distances
Abstrakt v dalším jazyce:	The term “collision detection” refers to the task of determining whether, in a given set of objects, any two intersect. If they do, then common collision detection systems return either one such pair or all such pairs. The term “proximity computation” refers to a more general task where we determine the nearest or the “most overlapping” pairs of objects. In the article, we present a new method to rapidly compute lower bounds of distances. The lower bound decreases the complexity of collision detection (or proximity computation) by computing “candidates” of collision, i.e., pairs of objects that might intersect. It estimates the lower bound of their distance and rejects pairs that are too far from each other to collide.
Práva:	© Václav Skala - UNION Agency
Vyskytuje se v kolekcích:	Volume 5, number 1-3 (1997)

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