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 2005

View larger image

QTY:

Efficient Proximity Mapping in Highly Dynamic Environments
Price	$5.95
Adjustment
Type
Stock	Unlimited
Status
Weight	0 lb, 0 oz
SKU	GDC-05-076
Statistics

Description

Efficient Proximity Mapping in Highly Dynamic Environments,
3919

Programming, Lecture

Andrea Pessino
Technical Director, Ready At Dawn Studios, LLC
The ability to efficiently determine geometric proximity between entities is one of the most crucial requirements for any dynamic system, and it is the foundation of many core algorithms for physical simulation, collision detection and response, visibility determination, AI, and more. In this lecture, the problem of proximity mapping is introduced, a few popular solutions are briefly surveyed, and then a new data structure using multi-resolution uniform space partitioning is proposed. The major benefits of the new technique are its efficiency with highly dynamic systems, its scalability, adaptability and simplicity. The lecture concludes with a practical discussion on how to effectively implement the data structure and related algorithms in both two and three dimensions.

Attendees learn about the complex issue of determining geometric proximity between objects in two and three dimensions. They gather a perspective on how the problem is typically solved in major titles and are given detailed practical knowledge on how to implement a novel and effective technique.

Please leave this field blank.