Self-Customized BSP Trees for Collision Detection

Self-Customized BSP Trees for Collision Detection (2000)

by Sigal Ar , Bernard Chazelle , Ayellet Tal

Citations:

13 - 1 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Self-Customized BSP Trees for Collision Detection	user correction - Legacy Corrections
AUTHOR NAME	Sigal Ar	user correction - Legacy Corrections
AUTHOR NAME	Bernard Chazelle	user correction - Legacy Corrections
AUTHOR AFFIL	z	user correction - Legacy Corrections
AUTHOR NAME	Ayellet Tal	user correction - Legacy Corrections
AUTHOR AFFIL	x	user correction - Legacy Corrections
ABSTRACT	The ability to perform efficient collision detection is essential in virtual reality environments and their applications, such as walkthroughs. In this paper we re-explore a classical structure used for collision detection -- the binary space partitioning tree. Unlike the common approach, which attributes equal likelihood to each possible query, we assume events that happened in the past are more likely to happen again in the future. This leads us to the definition of self-customized data structures. We report encouraging results obtained while experimenting with this concept in the context of self-customized bsp trees. Keywords: Collision detection, binary space partitioning, self-customization. 1 Introduction Virtual reality refers to the use of computer graphics to simulate physical worlds or to generate synthetic ones, where a user is to feel immersed in the environment to the extent that the user feels as if "objects" seen are really there. For example, "objects" should m...	user correction - Legacy Corrections
YEAR	2000	user correction - Legacy Corrections
CITATIONS	31 found	ParsCit 1.0