Collision Detection Using the GJK Algorithm

View Sample PDF

Author(s): William N. Bittle (dyn4j.org, USA)
Copyright: 2012
Pages: 36
Source title: Algorithmic and Architectural Gaming Design: Implementation and Development
Source Author(s)/Editor(s): Ashok Kumar (University of Louisiana at Lafayette, USA), Jim Etheredge (University of Louisiana at Lafayette, USA)and Aaron Boudreaux (University of Louisiana at Lafayette, USA)
DOI: 10.4018/978-1-4666-1634-9.ch011

Keywords: Gaming / Information Science Reference / Media & Communications / Multimedia Technology

Purchase

View Collision Detection Using the GJK Algorithm on the publisher's website for pricing and purchasing information.

Abstract

GJK is a fast and elegant collision detection algorithm. Originally designed to determine the distance between two convex shapes, it has been adapted to collision detection, continuous collision detection, and ray casting. Its versatility, speed, and compactness have allowed GJK to be one of the top choices of collision detection algorithms in a number of fields.

The IRMA Community

Research IRM

Collision Detection Using the GJK Algorithm

Purchase

Abstract

Related Content

IRMA Sponsors