CSE 381 – Advanced Game ProgrammingCollision Detection.pptVIP

Improvements on MSA It greatly reduces the number of object-object comparisons. How? it only compares objects near each other on one of the 3 axes How? sorting Sweep Prune approach Think of each axis separately, for each object considered: Calculate position range on x-axis extract (minX, maxX) Place all (minX, maxX) pairs into array Sort array by minX now, it’s easy to see what overlaps in X axis an O(N) problem, not O(N2). Why? don’t compare all objects to one another, only ones “near” each other note, we’ll have sorting costs, of course For x-axis collided pairs, repeat for Y Z axes Pairs that overlapped on all 3 tests collided Combining our Algorithms Sweep and Prune will tell us if a collision might happen Continuous collision detection will tell us when it happens it might also tell us S P gave us a false positive Picking Selecting a 3D object from its 2D projection on the screen by pointing and clicking with a mouse Why is this useful? players selecting game objects/targets i.e., which enemy to attack bullets traveling through game world determining which player/NPC it hits How is picking done? Build a ray (like a vector) Where’s the origin? the camera a gun What direction is the ray? from camera to a world point that projects onto the screen at the screen location Find those objects that are intersected by the ray Testing for picking intersections Traverse through scene graphs to find those with triangles that intersect the ray Gather data about these intersections as needed Point of intersection Normal vector at intersection Surface attributes (color, texture coordinate) Etc. Find the closest triangle to the ray’s origin How do we test intersections with linear components? Depends on what it’s intersecting sphere box triangle Each use different types of calculations e.g., sphere collision equations based on use of quadratic equation Recursively finding triangles pseudocode void FindPickTriangles(Node node, Ray ray, PickResults results) { if (