Title:	Lower bound of distance in 3D
Authors:	Konečný, Petr Zikan, Karel
Citation:	Journal of WSCG. 1997, vol. 5, no. 1-3, p. 1-16.
Issue Date:	1997
Publisher:	Václav Skala - UNION Agency
Document type:	č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)
Keywords:	detekce kolizí;výpočet dolní hranice vzdálenosti
Keywords in different language:	collision detection;compute lower bounds of distances
Abstract in different language:	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.
Rights:	© Václav Skala - UNION Agency
Appears in Collections:	Volume 5, number 1-3 (1997)

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.