You can edit almost every page by Creating an account. Otherwise, see the FAQ.

Broad Phase

From EverybodyWiki Bios & Wiki

Broad Phase, a computer science term, is one of the stages that make up a collision detection pipeline. It is often the first of two stages in this pipeline, the other being the narrow phase. Rarely, there are three stages in which the second stage is called the mid-phase and is followed by the narrow phase. In the broad phase, before the detailed and computationally expensive, narrow phase, it is determined what, if any, collisions are necessarily possible between a set of objects in a euclidean space. In this stage, less detailed and less costly collision algorithms are used such as bounding volume hierarchies: AABB, OBB, k-DOP, bounding sphere, or convex hull. The purpose of using a broad phase is to avoid computationally expensive collision detection algorithms all together until they are actuallly nessicary for mesh on mesh collision detection.

See also[edit]

References[edit]


This article "Broad Phase" is from Wikipedia. The list of its authors can be seen in its historical and/or the page Edithistory:Broad Phase. Articles copied from Draft Namespace on Wikipedia could be seen on the Draft Namespace of Wikipedia and not main one.