UBM Tech - Game Network

My Shopping Cart

[ 0 ] items in cart

View Cart | Checkout

Game Developer Research

Research Reports

Gamasutra

Contractor Listings

GDC Vault

Individual Subscription

GDC Audio Recordings

App Developers Conference 2013

GDC Next 2013

GDC Europe 2013

	GDC 2013
	GDC Online 2012
	GDC Europe 2012
	GDC 2012
	GDC 2011
	GDC 10
	GDC 09
	GDC Austin 08
	GDC Mobile 08
	GDC 08
	GDC Austin 07
	GDC Mobile 07
	GDC 07
	GDC 06
	GDC 05
	GDC 04
	GDC 03
	GDC 01
	GDC 2000 & Before

Newest Item(s)

Why Now Is the Best Time Ever to Be a Game Developer

Ingress: Design Principles Behind Google's Massively Multiplayer Geo Game

Playing with 'Game'

Gathering Your Party with Project Eternity (GDC Next 10)

D4: Dawn of the Dreaming Director's Drama (GDC Next 10)

Using Plot Devices to Create Gameplay in Storyteller (GDC Next 10)

How I Learned to Stop Worrying and Love Making CounterSpy (GDC Next 10)

Luck and Skill in Games

Minimalist Game Design for Mobile Devices

Broken Age: Rethinking a Classic Genre for the Modern Era (GDC Next 10)

Storefront > GDC Vault Store - Audio Recordings > More GDC > GDC 2003

View larger image

QTY:

Fast Proximity Queries for Large Game Environments
Price	$5.95
Adjustment
Type
Stock	Unlimited
Status
Weight	8 lb, 1 oz
SKU	GDC-03-130
Statistics

Description

Fast Proximity Queries for Large Game Environments,
851

Programming, Lecture

Ming Lin
Professor, University of North Carolina
The problems of collision or interference detection between two or more objects in dynamic environments are fundamental in computer graphics, robotics and computer simulated environments. These problems have been extensively studied in the literature. However, few efficient and accurate algorithms are known for large, complex dynamic settings, especially those encountered in the game environments. We will present fast algorithms for contact determination and interference detection between geometric models undergoing motion, as well as processing and management of large number of objects in the environment. The algorithms make use of temporal and spatial coherence between successive instances and hierarchical data structures. Their running time is a function of the motion between successive instances. The main characteristics of these algorithms are their simplicity and efficiency. They have been implemented. We will demonstrate their application in interaction with walkthroughs, multi-body simulation and physically-based simulation. A major subset of these implementations, including I-Collide, RAPID, V-Collide, PQP, SWIFT/SWIFT++, PIVOT and DEEP are available as part of the collision detection packages available at the UNC-CH website.

Please leave this field blank.