Collision processing

Size: px
Start display at page:

Download "Collision processing"

Transcription

1 Collision processing Different types of collisions Collision of a simulated deformable structure with a kinematic structure (easier) Collision with a rigid moving object, the ground, etc. Collision object can even be deforming as long as its deformation is kinematic (i.e. scripted), not simulated Self collision within a deformable structure (harder) Also includes collision between 2+ deformable structures CS838 Advanced Modeling and Simulation

2 Collision processing Different types of collisions Collision of a simulated deformable structure with a kinematic structure (easier) Collision with a rigid moving object, the ground, etc. Collision object can even be deforming as long as its deformation is kinematic (i.e. scripted), not simulated Self collision within a deformable structure (harder) Also includes collision between 2+ deformable structures CS838 Advanced Modeling and Simulation

3 Collision processing Typically partitioned into two tasks/phases Collision detection Detect if an interpenetration event occurred Localize such events, in space and time (If required) determine depth and direction of collision Collision response (or resolution) Attempt to resolve and fix all collisions, and/or Try to make collision less severe (but tolerate some), and/or Take steps to prevent collisions in the imminent future CS838 Advanced Modeling and Simulation

4 Collision processing Typically partitioned into two tasks/phases Collision detection Detect if an interpenetration event occurred Localize such events, in space and time (If required) determine depth and direction of collision The exact nature of collision detection depends on how we expect to use that information in the response stage! Collision response (or resolution) Attempt to resolve and fix all collisions, and/or Try to make collision less severe (but tolerate some), and/or Take steps to prevent collisions in the imminent future CS838 Advanced Modeling and Simulation

5 Collision response (general approaches) Penalty-based methods Detect proximity to collision objects and apply a repulsive penalty force when the distance to the collision target is small Increase strength of repulsion force as distance decreases (or as interpenetration starts to occur) Does not strictly enforce a collision-free state, but attempts to prevent it, and lessen the degree of collision CS838 Advanced Modeling and Simulation

6 Collision response (general approaches) Penalty-based methods Detect proximity to collision objects and apply a repulsive penalty force when the distance to the collision target is small Increase strength of repulsion force as distance decreases (or as interpenetration starts to occur) Does not strictly enforce a collision-free state, but attempts to prevent it, and lessen the degree of collision CS838 Advanced Modeling and Simulation

7 Collision response (general approaches) Penalty-based methods Detect proximity to collision objects and apply a repulsive penalty force when the distance to the collision target is small Increase strength of repulsion force as distance decreases (or as interpenetration starts to occur) Does not strictly enforce a collision-free state, but attempts to prevent it, and lessen the degree of collision CS838 Advanced Modeling and Simulation

8 Collision response (general approaches) Penalty-based methods Detect proximity to collision objects and apply a repulsive penalty force when the distance to the collision target is small Increase strength of repulsion force as distance decreases (or as interpenetration starts to occur) Does not strictly enforce a collision-free state, but attempts to prevent it, and lessen the degree of collision CS838 Advanced Modeling and Simulation

9 Collision response (general approaches) Penalty-based methods Detect proximity to collision objects and apply a repulsive penalty force when the distance to the collision target is small Increase strength of repulsion force as distance decreases (or as interpenetration starts to occur) Does not strictly enforce a collision-free state, but attempts to prevent it, and lessen the degree of collision CS838 Advanced Modeling and Simulation

10 Collision response (general approaches) Penalty-based methods Detect proximity to collision objects and apply a repulsive penalty force when the distance to the collision target is small Increase strength of repulsion force as distance decreases (or as interpenetration starts to occur) Does not strictly enforce a collision-free state, but attempts to prevent it, and lessen the degree of collision CS838 Advanced Modeling and Simulation

11 Collision response (general approaches) Penalty-based methods Detect proximity to collision objects and apply a repulsive penalty force when the distance to the collision target is small Increase strength of repulsion force as distance decreases (or as interpenetration starts to occur) Does not strictly enforce a collision-free state, but attempts to prevent it, and lessen the degree of collision CS838 Advanced Modeling and Simulation

12 Collision response (general approaches) Penalty-based methods Detect proximity to collision objects and apply a repulsive penalty force when the distance to the collision target is small Increase strength of repulsion force as distance decreases (or as interpenetration starts to occur) Does not strictly enforce a collision-free state, but attempts to prevent it, and lessen the degree of collision CS838 Advanced Modeling and Simulation

13 Collision response (general approaches) Penalty-based methods Detect proximity to collision objects and apply a repulsive penalty force when the distance Requirements to the collision for the detection stage: target Detection is small of static proximity (not just collision) Increase Estimation strength of of proximity repulsion or collision distance force as (such distance that forces decreases can be accordingly scaled) (or Estimation of collision direction as interpenetration starts (such that forces can be accordingly oriented) to occur) Does not strictly enforce a collision-free state, but attempts to prevent it, and lessen the degree of collision CS838 Advanced Modeling and Simulation

14 Collision response (general approaches) Impulse-based methods Usually attempt to guarantee that no collision is produced or left untreated, at any time Starting from a collision-free state at time t*, the system is advanced to time t*+dt Collisions that occurred in the interval [t*,t*+dt] are localized (in space and time) An impulse is applied to instantaneously correct the object trajectory and prevent (or fix) any collision events CS838 Advanced Modeling and Simulation

15 Collision response (general approaches) Impulse-based methods Usually attempt to guarantee that no collision is produced or left untreated, at any time Starting from a collision-free state at time t*, the system is advanced to time t*+dt Collisions that occurred in the interval [t*,t*+dt] are localized (in space and time) An impulse is applied to instantaneously correct the object trajectory and prevent (or fix) any collision events CS838 Advanced Modeling and Simulation

16 Collision response (general approaches) Impulse-based methods Usually attempt to guarantee that no collision is produced or left untreated, at any time Starting from a collision-free state at time t*, the system is advanced to time t*+dt Collisions that occurred in the interval [t*,t*+dt] are localized (in space and time) An impulse is applied to instantaneously correct the object trajectory and prevent (or fix) any collision events CS838 Advanced Modeling and Simulation

17 Collision response (general approaches) Impulse-based methods Can be structured to provide guarantees of noninterpenetration (makes other parts of the simulation simpler and easier) Capable of enforcing tight contact, instead of modeling a large, artificial thickness for the collision object Not guaranteed to succeed, especially with conflicting nonphysical constraints Relatively slow and expensive CS838 Advanced Modeling and Simulation

18 Collision response (general approaches) Impulse-based methods Can be structured to provide guarantees of noninterpenetration (makes other parts of the simulation simpler and easier) Capable of enforcing tight Requirements for the detection stage: contact, Detection instead of of modeling moving collisions a (not just static) large, artificial Estimation thickness of the exact for time/location of every the collision impact object event Not guaranteed to succeed, especially with conflicting nonphysical constraints Relatively slow and expensive CS838 Advanced Modeling and Simulation

19 Collision response (general approaches) Continuous time collisions Most physically justified technique : handle one collision event at a time, in the order they occur Can be structured to pursue full avoidance of collisions, while not requiring collision objects to be thickened Response can be formulated in terms of simple and intuitive penalty forces Disadvantage : May lead to very small time steps CS838 Advanced Modeling and Simulation

20 Collision response (general approaches) Continuous time collisions Most physically justified technique : handle one collision event at a time, in the order they occur Can be structured to pursue full avoidance of collisions, while not requiring collision objects to be thickened Response can be formulated in terms of simple and intuitive penalty forces Disadvantage : May lead to very small time steps CS838 Advanced Modeling and Simulation

21 Collision response (general approaches) Continuous time collisions Most physically justified technique : handle one collision event at a time, in the order they occur Can be structured to pursue full avoidance of collisions, while not requiring collision objects to be thickened Response can be formulated in terms of simple and intuitive penalty forces Disadvantage : May lead to very small time steps CS838 Advanced Modeling and Simulation

22 Collision response (general approaches) Continuous time collisions Most physically justified technique : handle one collision event at a time, in the order they occur Can be structured to pursue full avoidance of collisions, while not requiring collision objects to be thickened Response can be formulated in terms of simple and intuitive penalty forces Disadvantage : May lead to very small time steps CS838 Advanced Modeling and Simulation

23 Collision response (general approaches) Continuous time collisions Most physically justified technique : handle one collision event at a time, in the order they occur Can be structured to pursue full avoidance of collisions, while not requiring collision objects to be thickened Response can be formulated in terms of simple and intuitive penalty forces Disadvantage : May lead to very small time steps CS838 Advanced Modeling and Simulation

24 Collision detection (for kinematic objects) Simplest case: Collision object is rigid We can pre-process the object into a levelset Query : Is a point x* colliding with the object? Yes, if and only if Query : Is a point x* within a distance D of the object? Yes, if and only if Query : What is the direction of the collision (i.e. what is the shortest way out?) Given by the vector Query : What point on the surface of the object is closest to x*? Given as CS838 Advanced Modeling and Simulation

25 Represent a curve in 2D (or, a surface in 3D) as the zero isocontour of a (continuous) function, i.e. e.g. C = {(x.y) R 2 : φ(x, y) =0} circle x 2 + y 2 = R 2 {(x, y) :φ(x, y) =0} where φ(x, y) =x 2 + y 2 R 2 z =0 CS838 Advanced Modeling and Simulation

26 φ(x, y) < 0, if (x, y) isinsidec φ(x, y) > 0, if (x, y) is outside C φ(x, y) =0, if (x, y) is on C and φ(x, y) = distance of (x, y) from C CS838 Advanced Modeling and Simulation

27 Collision detection (for kinematic objects) Simplest case: Collision object is rigid We can pre-process the object into a levelset Query : Is a point x* colliding with the object? Yes, if and only if Query : Is a point x* within a distance D of the object? Yes, if and only if Query : What is the direction of the collision (i.e. what is the shortest way out?) Given by the vector Query : What point on the surface of the object is closest to x*? Given as φ(x ) < 0 CS838 Advanced Modeling and Simulation

28 Collision detection (for kinematic objects) Simplest case: Collision object is rigid We can pre-process the object into a levelset Query : Is a point x* colliding with the object? Yes, if and only if Query : Is a point x* within a distance D of the object? Yes, if and only if Query : What is the direction of the collision (i.e. what is the shortest way out?) Given by the vector Query : What point on the surface of the object is closest to x*? Given as φ(x ) < 0 φ(x ) <D CS838 Advanced Modeling and Simulation

29 Collision detection (for kinematic objects) Simplest case: Collision object is rigid We can pre-process the object into a levelset Query : Is a point x* colliding with the object? Yes, if and only if Query : Is a point x* within a distance D of the object? Yes, if and only if Query : What is the direction of the collision (i.e. what is the shortest way out?) Given by the vector Query : What point on the surface of the object is closest to x*? Given as φ(x ) < 0 φ(x ) <D φ(x ) CS838 Advanced Modeling and Simulation

30 Collision detection (for kinematic objects) Simplest case: Collision object is rigid We can pre-process the object into a levelset Query : Is a point x* colliding with the object? Yes, if and only if Query : Is a point x* within a distance D of the object? Yes, if and only if Query : What is the direction of the collision (i.e. what is the shortest way out?) Given by the vector φ(x ) < 0 φ(x ) <D φ(x ) Query : What point on the surface of the object is closest to x*? Given as x surface = x φ(x ) φ(x ) CS838 Advanced Modeling and Simulation

31 Collision detection (for simulated objects) Cannot (easily and efficiently) convert into levelsets to facilitate O(1) collision queries Sometimes we seek collisions between open surfaces, which do not have an interior to describe as a levelset If simulation contains N primitives (particles, segments, triangles, etc) there is a potential for O(N^2) candidate intersection pairs Brute force check would require O(N^2) cost Every simulation step ideally requires O(N) effort (e.g. with Forward Euler, or BE with fixed CG iterations) Ideally the detection cost should not exceed O(N) by much Popular approach : Using axis-aligned bounding box (AABB) queries to accelerate collision detection CS838 Advanced Modeling and Simulation

32 CS838 Advanced Modeling and Simulation

33 CS838 Advanced Modeling and Simulation

34 CS838 Advanced Modeling and Simulation

35 CS838 Advanced Modeling and Simulation

36 CS838 Advanced Modeling and Simulation

37 CS838 Advanced Modeling and Simulation

38 CS838 Advanced Modeling and Simulation

39 CS838 Advanced Modeling and Simulation

40 CS838 Advanced Modeling and Simulation

41 CS838 Advanced Modeling and Simulation

42 CS838 Advanced Modeling and Simulation

43 CS838 Advanced Modeling and Simulation

44 CS838 Advanced Modeling and Simulation

45 CS838 Advanced Modeling and Simulation

46 CS838 Advanced Modeling and Simulation

47 CS838 Advanced Modeling and Simulation

48 CS838 Advanced Modeling and Simulation

49 CS838 Advanced Modeling and Simulation

50 CS838 Advanced Modeling and Simulation

51 CS838 Advanced Modeling and Simulation

52 CS838 Advanced Modeling and Simulation

53 CS838 Advanced Modeling and Simulation

54 CS838 Advanced Modeling and Simulation

55 CS838 Advanced Modeling and Simulation

56 CS838 Advanced Modeling and Simulation

57 CS838 Advanced Modeling and Simulation

58 CS838 Advanced Modeling and Simulation

59 CS838 Advanced Modeling and Simulation

60 CS838 Advanced Modeling and Simulation

61 CS838 Advanced Modeling and Simulation

62 ? CS838 Advanced Modeling and Simulation

63 CS838 Advanced Modeling and Simulation

64 CS838 Advanced Modeling and Simulation

65 ?? CS838 Advanced Modeling and Simulation

66 CS838 Advanced Modeling and Simulation

67 CS838 Advanced Modeling and Simulation

68 ?? CS838 Advanced Modeling and Simulation

69 CS838 Advanced Modeling and Simulation

70 CS838 Advanced Modeling and Simulation

71 ?? CS838 Advanced Modeling and Simulation

72 Collision detection (for simulated objects) Popular approach : Using axis-aligned bounding box (AABB) queries to accelerate collision detection Prunes away most of the faraway collisions Cost to check one primitive, against a box B-tree hierarchy with k leaves : O(logk) in the best case Cost will increase if the box hierarchy is not optimally constructed (i.e. if we chose to merge faraway boxes) Quality of hierarchy will degrade as object moves : May choose to re-build the hierarchy from scratch every few time steps KD-Tree or Quad-/Oct-trees can be used to generate box hierarchies CS838 Advanced Modeling and Simulation

Collision and Proximity Queries

Collision and Proximity Queries Collision and Proximity Queries Dinesh Manocha (based on slides from Ming Lin) COMP790-058 Fall 2013 Geometric Proximity Queries l Given two object, how would you check: If they intersect with each other

More information

Cloth Animation with Collision Detection

Cloth Animation with Collision Detection Cloth Animation with Collision Detection Mara Guimarães da Silva Figure 1: Cloth blowing in the wind. Abstract This document reports the techniques and steps used to implemented a physically based animation

More information

CPSC / Sonny Chan - University of Calgary. Collision Detection II

CPSC / Sonny Chan - University of Calgary. Collision Detection II CPSC 599.86 / 601.86 Sonny Chan - University of Calgary Collision Detection II Outline Broad phase collision detection: - Problem definition and motivation - Bounding volume hierarchies - Spatial partitioning

More information

Collision Detection. These slides are mainly from Ming Lin s course notes at UNC Chapel Hill

Collision Detection. These slides are mainly from Ming Lin s course notes at UNC Chapel Hill Collision Detection These slides are mainly from Ming Lin s course notes at UNC Chapel Hill http://www.cs.unc.edu/~lin/comp259-s06/ Computer Animation ILE5030 Computer Animation and Special Effects 2 Haptic

More information

References. Additional lecture notes for 2/18/02.

References. Additional lecture notes for 2/18/02. References Additional lecture notes for 2/18/02. I-COLLIDE: Interactive and Exact Collision Detection for Large-Scale Environments, by Cohen, Lin, Manocha & Ponamgi, Proc. of ACM Symposium on Interactive

More information

Jane Li. Assistant Professor Mechanical Engineering Department, Robotic Engineering Program Worcester Polytechnic Institute

Jane Li. Assistant Professor Mechanical Engineering Department, Robotic Engineering Program Worcester Polytechnic Institute Jane Li Assistant Professor Mechanical Engineering Department, Robotic Engineering Program Worcester Polytechnic Institute (3 pts) How to generate Delaunay Triangulation? (3 pts) Explain the difference

More information

QP-Collide: A New Approach to Collision Treatment

QP-Collide: A New Approach to Collision Treatment QP-Collide: A New Approach to Collision Treatment Laks Raghupathi François Faure Co-encadre par Marie-Paule CANI EVASION/GRAVIR INRIA Rhône-Alpes, Grenoble Teaser Video Classical Physical Simulation Advance

More information

Homework 1: Implicit Surfaces, Collision Detection, & Volumetric Data Structures. Loop Subdivision. Loop Subdivision. Questions/Comments?

Homework 1: Implicit Surfaces, Collision Detection, & Volumetric Data Structures. Loop Subdivision. Loop Subdivision. Questions/Comments? Homework 1: Questions/Comments? Implicit Surfaces,, & Volumetric Data Structures Loop Subdivision Shirley, Fundamentals of Computer Graphics Loop Subdivision SIGGRAPH 2000 course notes Subdivision for

More information

Acceleration Data Structures

Acceleration Data Structures CT4510: Computer Graphics Acceleration Data Structures BOCHANG MOON Ray Tracing Procedure for Ray Tracing: For each pixel Generate a primary ray (with depth 0) While (depth < d) { Find the closest intersection

More information

Cloth Simulation. Tanja Munz. Master of Science Computer Animation and Visual Effects. CGI Techniques Report

Cloth Simulation. Tanja Munz. Master of Science Computer Animation and Visual Effects. CGI Techniques Report Cloth Simulation CGI Techniques Report Tanja Munz Master of Science Computer Animation and Visual Effects 21st November, 2014 Abstract Cloth simulation is a wide and popular area of research. First papers

More information

Rigid Body Simulation. Jeremy Ulrich Advised by David Mount Fall 2013

Rigid Body Simulation. Jeremy Ulrich Advised by David Mount Fall 2013 Rigid Body Simulation Jeremy Ulrich Advised by David Mount Fall 2013 Overview The project presented here is a real-time 3D rigid body physics engine, and is the result of an Independent Study on collision

More information

Collision Detection with Bounding Volume Hierarchies

Collision Detection with Bounding Volume Hierarchies Simulation in Computer Graphics Collision Detection with Bounding Volume Hierarchies Matthias Teschner Computer Science Department University of Freiburg Outline introduction bounding volumes BV hierarchies

More information

Spatial Data Structures

Spatial Data Structures CSCI 420 Computer Graphics Lecture 17 Spatial Data Structures Jernej Barbic University of Southern California Hierarchical Bounding Volumes Regular Grids Octrees BSP Trees [Angel Ch. 8] 1 Ray Tracing Acceleration

More information

An Adaptive Collision Detection and Resolution for Deformable Objects Using Spherical Implicit Surface

An Adaptive Collision Detection and Resolution for Deformable Objects Using Spherical Implicit Surface An Adaptive Collision Detection and Resolution for Deformable Objects Using Spherical Implicit Surface Sunhwa Jung 1, Min Hong 2, and Min-Hyung Choi 1 1 Department of Computer Science and Engineering,

More information

Spatial Data Structures

Spatial Data Structures CSCI 480 Computer Graphics Lecture 7 Spatial Data Structures Hierarchical Bounding Volumes Regular Grids BSP Trees [Ch. 0.] March 8, 0 Jernej Barbic University of Southern California http://www-bcf.usc.edu/~jbarbic/cs480-s/

More information

Collision Detection II. These slides are mainly from Ming Lin s course notes at UNC Chapel Hill

Collision Detection II. These slides are mainly from Ming Lin s course notes at UNC Chapel Hill Collision Detection II These slides are mainly from Ming Lin s course notes at UNC Chapel Hill http://www.cs.unc.edu/~lin/comp259-s06/ Some Possible Approaches Geometric methods Algebraic techniques Hierarchical

More information

Topics. Ray Tracing II. Intersecting transformed objects. Transforming objects

Topics. Ray Tracing II. Intersecting transformed objects. Transforming objects Topics Ray Tracing II CS 4620 Lecture 16 Transformations in ray tracing Transforming objects Transformation hierarchies Ray tracing acceleration structures Bounding volumes Bounding volume hierarchies

More information

CAB: Fast Update of OBB Trees for Collision Detection between Articulated Bodies

CAB: Fast Update of OBB Trees for Collision Detection between Articulated Bodies CAB: Fast Update of OBB Trees for Collision Detection between Articulated Bodies Harald Schmidl Nolan Walker Ming C. Lin {schmidl walkern lin}@cs.unc.edu Department of Computer Science Sitterson Hall,

More information

Ray Tracing Acceleration. CS 4620 Lecture 20

Ray Tracing Acceleration. CS 4620 Lecture 20 Ray Tracing Acceleration CS 4620 Lecture 20 2013 Steve Marschner 1 Will this be on the exam? or, Prelim 2 syllabus You can expect emphasis on topics related to the assignment (Shaders 1&2) and homework

More information

Lecture 24 of 41. Collision Handling Part 1 of 2: Separating Axes, Oriented Bounding Boxes

Lecture 24 of 41. Collision Handling Part 1 of 2: Separating Axes, Oriented Bounding Boxes Collision Handling Part 1 of 2: Separating Axes, Oriented Bounding Boxes William H. Hsu Department of Computing and Information Sciences, KSU KSOL course pages: http://bit.ly/hgvxlh / http://bit.ly/evizre

More information

Bounding Volume Hierarchies

Bounding Volume Hierarchies Tutorial: Real-Time Collision Detection for Dynamic Virtual Environments Bounding Volume Hierarchies Stefan Kimmerle WSI/GRIS University of Tübingen Outline Introduction Bounding Volume Types Hierarchy

More information

Topics. Ray Tracing II. Transforming objects. Intersecting transformed objects

Topics. Ray Tracing II. Transforming objects. Intersecting transformed objects Topics Ray Tracing II CS 4620 ations in ray tracing ing objects ation hierarchies Ray tracing acceleration structures Bounding volumes Bounding volume hierarchies Uniform spatial subdivision Adaptive spatial

More information

Accelerated Raytracing

Accelerated Raytracing Accelerated Raytracing Why is Acceleration Important? Vanilla ray tracing is really slow! mxm pixels, kxk supersampling, n primitives, average ray path length of d, l lights, 2 recursive ray casts per

More information

Fast continuous collision detection among deformable Models using graphics processors CS-525 Presentation Presented by Harish

Fast continuous collision detection among deformable Models using graphics processors CS-525 Presentation Presented by Harish Fast continuous collision detection among deformable Models using graphics processors CS-525 Presentation Presented by Harish Abstract: We present an interactive algorithm to perform continuous collision

More information

Simulation (last lecture and this one)

Simulation (last lecture and this one) Simulation (last lecture and this one) How used in games? Dynamics Collisions simple ------------------------------- Collisions harder detection bounding boxes response Controllers Mocap + simulation User

More information

Real-time Continuous Collision Detection and Penetration Depth Computation

Real-time Continuous Collision Detection and Penetration Depth Computation Real-time Continuous Collision Detection and Penetration Depth Computation Young J. Kim http://graphics.ewha.ac.kr Ewha Womans University Non-penetration Constraint No overlap between geometric objects

More information

Spatial Data Structures and Speed-Up Techniques. Tomas Akenine-Möller Department of Computer Engineering Chalmers University of Technology

Spatial Data Structures and Speed-Up Techniques. Tomas Akenine-Möller Department of Computer Engineering Chalmers University of Technology Spatial Data Structures and Speed-Up Techniques Tomas Akenine-Möller Department of Computer Engineering Chalmers University of Technology Spatial data structures What is it? Data structure that organizes

More information

A simple example. Assume we want to find the change in the rotation angles to get the end effector to G. Effect of changing s

A simple example. Assume we want to find the change in the rotation angles to get the end effector to G. Effect of changing s CENG 732 Computer Animation This week Inverse Kinematics (continued) Rigid Body Simulation Bodies in free fall Bodies in contact Spring 2006-2007 Week 5 Inverse Kinematics Physically Based Rigid Body Simulation

More information

An efficient space partitioning technique based on linear kd-trees for collision culling

An efficient space partitioning technique based on linear kd-trees for collision culling An efficient space partitioning technique based on linear kd-trees for collision culling Abstract We present an efficient broad phase algorithm for selecting candidate collision pairs in N-body simulation.

More information

Collision Detection. Jane Li Assistant Professor Mechanical Engineering & Robotics Engineering

Collision Detection. Jane Li Assistant Professor Mechanical Engineering & Robotics Engineering RBE 550 MOTION PLANNING BASED ON DR. DMITRY BERENSON S RBE 550 Collision Detection Jane Li Assistant Professor Mechanical Engineering & Robotics Engineering http://users.wpi.edu/~zli11 Euler Angle RBE

More information

Ray Tracing Acceleration. CS 4620 Lecture 22

Ray Tracing Acceleration. CS 4620 Lecture 22 Ray Tracing Acceleration CS 4620 Lecture 22 2014 Steve Marschner 1 Topics Transformations in ray tracing Transforming objects Transformation hierarchies Ray tracing acceleration structures Bounding volumes

More information

Using Bounding Volume Hierarchies Efficient Collision Detection for Several Hundreds of Objects

Using Bounding Volume Hierarchies Efficient Collision Detection for Several Hundreds of Objects Part 7: Collision Detection Virtuelle Realität Wintersemester 2007/08 Prof. Bernhard Jung Overview Bounding Volumes Separating Axis Theorem Using Bounding Volume Hierarchies Efficient Collision Detection

More information

Overview. Collision Detection. A Simple Collision Detection Algorithm. Collision Detection in a Dynamic Environment. Query Types.

Overview. Collision Detection. A Simple Collision Detection Algorithm. Collision Detection in a Dynamic Environment. Query Types. Overview Collision Detection Alan Liu aliu@usuhs.mil The Surgical Simulation Laboratory National Capital Area Medical Simulation Center Uniformed Services University http://simcen.usuhs.mil/miccai2003

More information

l Without collision detection (CD), it is practically impossible to construct e.g., games, movie production tools (e.g., Avatar)

l Without collision detection (CD), it is practically impossible to construct e.g., games, movie production tools (e.g., Avatar) Collision Detection Originally created by Tomas Akenine-Möller Updated by Ulf Assarsson Department of Computer Engineering Chalmers University of Technology Introduction l Without collision detection (CD),

More information

Anatomy of a Physics Engine. Erwin Coumans

Anatomy of a Physics Engine. Erwin Coumans Anatomy of a Physics Engine Erwin Coumans erwin_coumans@playstation.sony.com How it fits together» Terminology» Rigid Body Dynamics» Collision Detection» Software Design Decisions» Trip through the Physics

More information

CSE 167: Introduction to Computer Graphics Lecture #18: More Effects. Jürgen P. Schulze, Ph.D. University of California, San Diego Fall Quarter 2016

CSE 167: Introduction to Computer Graphics Lecture #18: More Effects. Jürgen P. Schulze, Ph.D. University of California, San Diego Fall Quarter 2016 CSE 167: Introduction to Computer Graphics Lecture #18: More Effects Jürgen P. Schulze, Ph.D. University of California, San Diego Fall Quarter 2016 Announcements TA evaluations CAPE Final project blog

More information

Scene Management. Video Game Technologies 11498: MSc in Computer Science and Engineering 11156: MSc in Game Design and Development

Scene Management. Video Game Technologies 11498: MSc in Computer Science and Engineering 11156: MSc in Game Design and Development Video Game Technologies 11498: MSc in Computer Science and Engineering 11156: MSc in Game Design and Development Chap. 5 Scene Management Overview Scene Management vs Rendering This chapter is about rendering

More information

Collision Detection between Dynamic Rigid Objects and Static Displacement Mapped Surfaces in Computer Games

Collision Detection between Dynamic Rigid Objects and Static Displacement Mapped Surfaces in Computer Games between Dynamic Rigid Objects and Static Displacement Mapped Surfaces in Computer Games Author:, KTH Mentor: Joacim Jonsson, Avalanche Studios Supervisor: Prof. Christopher Peters, KTH 26 June, 2015 Overview

More information

Spatial Data Structures

Spatial Data Structures 15-462 Computer Graphics I Lecture 17 Spatial Data Structures Hierarchical Bounding Volumes Regular Grids Octrees BSP Trees Constructive Solid Geometry (CSG) April 1, 2003 [Angel 9.10] Frank Pfenning Carnegie

More information

Ray Tracing. Cornell CS4620/5620 Fall 2012 Lecture Kavita Bala 1 (with previous instructors James/Marschner)

Ray Tracing. Cornell CS4620/5620 Fall 2012 Lecture Kavita Bala 1 (with previous instructors James/Marschner) CS4620/5620: Lecture 37 Ray Tracing 1 Announcements Review session Tuesday 7-9, Phillips 101 Posted notes on slerp and perspective-correct texturing Prelim on Thu in B17 at 7:30pm 2 Basic ray tracing Basic

More information

Lesson 05. Mid Phase. Collision Detection

Lesson 05. Mid Phase. Collision Detection Lesson 05 Mid Phase Collision Detection Lecture 05 Outline Problem definition and motivations Generic Bounding Volume Hierarchy (BVH) BVH construction, fitting, overlapping Metrics and Tandem traversal

More information

Hidden surface removal. Computer Graphics

Hidden surface removal. Computer Graphics Lecture Hidden Surface Removal and Rasterization Taku Komura Hidden surface removal Drawing polygonal faces on screen consumes CPU cycles Illumination We cannot see every surface in scene We don t want

More information

Accelerating Geometric Queries. Computer Graphics CMU /15-662, Fall 2016

Accelerating Geometric Queries. Computer Graphics CMU /15-662, Fall 2016 Accelerating Geometric Queries Computer Graphics CMU 15-462/15-662, Fall 2016 Geometric modeling and geometric queries p What point on the mesh is closest to p? What point on the mesh is closest to p?

More information

Spatial Data Structures

Spatial Data Structures 15-462 Computer Graphics I Lecture 17 Spatial Data Structures Hierarchical Bounding Volumes Regular Grids Octrees BSP Trees Constructive Solid Geometry (CSG) March 28, 2002 [Angel 8.9] Frank Pfenning Carnegie

More information

Combinatorial optimization and its applications in image Processing. Filip Malmberg

Combinatorial optimization and its applications in image Processing. Filip Malmberg Combinatorial optimization and its applications in image Processing Filip Malmberg Part 1: Optimization in image processing Optimization in image processing Many image processing problems can be formulated

More information

Graphs, Search, Pathfinding (behavior involving where to go) Steering, Flocking, Formations (behavior involving how to go)

Graphs, Search, Pathfinding (behavior involving where to go) Steering, Flocking, Formations (behavior involving how to go) Graphs, Search, Pathfinding (behavior involving where to go) Steering, Flocking, Formations (behavior involving how to go) Class N-2 1. What are some benefits of path networks? 2. Cons of path networks?

More information

Overview. Collision detection. Collision detection. Brute force collision detection. Brute force collision detection. Motivation

Overview. Collision detection. Collision detection. Brute force collision detection. Brute force collision detection. Motivation Overview Collision detection Alan Liu aliu@simcen.usuhs.mil Surgical Simulation Laboratory National Capital Area Medical Simulation Center Uniformed Services University of the Health Sciences http://simcen.usuhs.mil/mmvr2002

More information

Collision detection. Piotr Fulma«ski. 1 grudnia

Collision detection. Piotr Fulma«ski. 1 grudnia Collision detection Piotr Fulma«ski piotr@fulmanski.pl 1 grudnia 2016 Table of contents Collision in games Algorithms to detect collision in games depend on the type of shapes that can collide (e.g. rectangle

More information

Dynamic Bounding Volume Hierarchies. Erin Catto, Blizzard Entertainment

Dynamic Bounding Volume Hierarchies. Erin Catto, Blizzard Entertainment Dynamic Bounding Volume Hierarchies Erin Catto, Blizzard Entertainment 1 This is one of my favorite Overwatch maps: BlizzardWorld. This is the spawn area inside the Hearthstone Tavern. 2 All the objects

More information

PolyDepth: Real-Time Penetration Depth Computation Using Iterative Contact-Space Projection

PolyDepth: Real-Time Penetration Depth Computation Using Iterative Contact-Space Projection ACM Transactions on Graphics (ToG), Vol. 31, No. 1, Article 5, 2012 PolyDepth: Real-Time Penetration Depth Computation Using Iterative Contact-Space Projection Changsoo Je Ewha Womans University and Sogang

More information

Task Description: Finding Similar Documents. Document Retrieval. Case Study 2: Document Retrieval

Task Description: Finding Similar Documents. Document Retrieval. Case Study 2: Document Retrieval Case Study 2: Document Retrieval Task Description: Finding Similar Documents Machine Learning for Big Data CSE547/STAT548, University of Washington Sham Kakade April 11, 2017 Sham Kakade 2017 1 Document

More information

Dynamic Collision Detection

Dynamic Collision Detection Distance Computation Between Non-Convex Polyhedra June 17, 2002 Applications Dynamic Collision Detection Applications Dynamic Collision Detection Evaluating Safety Tolerances Applications Dynamic Collision

More information

Continuous Collision Detection and Physics

Continuous Collision Detection and Physics Continuous Collision Detection and Physics Erwin Coumans, Sony Computer Entertainment August 2005, Draft revision 5 0 Overview A novel approach to Angular and Linear Continuous Collision Detection is presented.

More information

Animation. Keyframe animation. CS4620/5620: Lecture 30. Rigid motion: the simplest deformation. Controlling shape for animation

Animation. Keyframe animation. CS4620/5620: Lecture 30. Rigid motion: the simplest deformation. Controlling shape for animation Keyframe animation CS4620/5620: Lecture 30 Animation Keyframing is the technique used for pose-to-pose animation User creates key poses just enough to indicate what the motion is supposed to be Interpolate

More information

B553 Lecture 12: Global Optimization

B553 Lecture 12: Global Optimization B553 Lecture 12: Global Optimization Kris Hauser February 20, 2012 Most of the techniques we have examined in prior lectures only deal with local optimization, so that we can only guarantee convergence

More information

Discrete representations of geometric objects: Features, data structures and adequacy for dynamic simulation. Part I : Solid geometry

Discrete representations of geometric objects: Features, data structures and adequacy for dynamic simulation. Part I : Solid geometry Discrete representations of geometric objects: Features, data structures and adequacy for dynamic simulation. Surfaces Part I : Solid geometry hachar Fleishman Tel Aviv University David Levin Claudio T.

More information

Deformable and Fracturing Objects

Deformable and Fracturing Objects Interactive ti Collision i Detection ti for Deformable and Fracturing Objects Sung-Eui Yoon ( 윤성의 ) IWON associate professor KAIST http://sglab.kaist.ac.kr/~sungeui/ Acknowledgements Research collaborators

More information

Collision Detection. Motivation - Dynamic Simulation ETH Zurich. Motivation - Path Planning ETH Zurich. Motivation - Biomedical Simulation ETH Zurich

Collision Detection. Motivation - Dynamic Simulation ETH Zurich. Motivation - Path Planning ETH Zurich. Motivation - Biomedical Simulation ETH Zurich Collision Detection Motivation - Dynamic Simulation Collision detection is an essential part of physically realistic dynamic simulations. For each time step: compute dynamics detect collisions resolve

More information

Computer Graphics Ray Casting. Matthias Teschner

Computer Graphics Ray Casting. Matthias Teschner Computer Graphics Ray Casting Matthias Teschner Outline Context Implicit surfaces Parametric surfaces Combined objects Triangles Axis-aligned boxes Iso-surfaces in grids Summary University of Freiburg

More information

Data Structures for Moving Objects

Data Structures for Moving Objects Data Structures for Moving Objects Pankaj K. Agarwal Department of Computer Science Duke University Geometric Data Structures S: Set of geometric objects Points, segments, polygons Ask several queries

More information

CS535 Fall Department of Computer Science Purdue University

CS535 Fall Department of Computer Science Purdue University Spatial Data Structures and Hierarchies CS535 Fall 2010 Daniel G Aliaga Daniel G. Aliaga Department of Computer Science Purdue University Spatial Data Structures Store geometric information Organize geometric

More information

Motion Capture & Simulation

Motion Capture & Simulation Motion Capture & Simulation Motion Capture Character Reconstructions Joint Angles Need 3 points to compute a rigid body coordinate frame 1 st point gives 3D translation, 2 nd point gives 2 angles, 3 rd

More information

Recall: Inside Triangle Test

Recall: Inside Triangle Test 1/45 Recall: Inside Triangle Test 2D Bounding Boxes rasterize( vert v[3] ) { bbox b; bound3(v, b); line l0, l1, l2; makeline(v[0],v[1],l2); makeline(v[1],v[2],l0); makeline(v[2],v[0],l1); for( y=b.ymin;

More information

Real-Time Collision Detection for Dynamic Virtual Environments

Real-Time Collision Detection for Dynamic Virtual Environments Real-Time Collision Detection for Dynamic Virtual Environments Gabriel Zachmann, Matthias Teschner, Stefan Kimmerle, Bruno Heidelberger, Laks Raghupathi, Arnulph Fuhrmann To cite this version: Gabriel

More information

Steering 1. from Millington, "Artificial Intelligence for Games", MKP 2006.

Steering 1. from Millington, Artificial Intelligence for Games, MKP 2006. Steering 1 from Millington, "Artificial Intelligence for Games", MKP 2006. Movement Algorithms kinematic movement computes a velocity for the object based on current position no acceleration dynamic movement

More information

Lecture VI: Constraints and Controllers. Parts Based on Erin Catto s Box2D Tutorial

Lecture VI: Constraints and Controllers. Parts Based on Erin Catto s Box2D Tutorial Lecture VI: Constraints and Controllers Parts Based on Erin Catto s Box2D Tutorial Motion Constraints In practice, no rigid body is free to move around on its own. Movement is constrained: wheels on a

More information

Lecture VI: Constraints and Controllers

Lecture VI: Constraints and Controllers Lecture VI: Constraints and Controllers Motion Constraints In practice, no rigid body is free to move around on its own. Movement is constrained: wheels on a chair human body parts trigger of a gun opening

More information

Intersection Acceleration

Intersection Acceleration Advanced Computer Graphics Intersection Acceleration Matthias Teschner Computer Science Department University of Freiburg Outline introduction bounding volume hierarchies uniform grids kd-trees octrees

More information

11 - Spatial Data Structures

11 - Spatial Data Structures 11 - Spatial Data Structures cknowledgement: Marco Tarini Types of Queries Graphic applications often require spatial queries Find the k points closer to a specific point p (k-nearest Neighbours, knn)

More information

animation projects in digital art animation 2009 fabio pellacini 1

animation projects in digital art animation 2009 fabio pellacini 1 animation projects in digital art animation 2009 fabio pellacini 1 animation shape specification as a function of time projects in digital art animation 2009 fabio pellacini 2 how animation works? flip

More information

Geometry proxies (in 2D): a Convex Polygon

Geometry proxies (in 2D): a Convex Polygon Geometry proxies (in 2D): a Convex Polygon Intersection of half-planes each delimited by a line Stored as: Test: a collection of (oriented) lines a point is inside iff it is in each half-plane A very good

More information

Collision detection. Piotr Fulma«ski. 19 pa¹dziernika Wydziaª Matematyki i Informatyki, Uniwersytet Šódzki, Polska

Collision detection. Piotr Fulma«ski. 19 pa¹dziernika Wydziaª Matematyki i Informatyki, Uniwersytet Šódzki, Polska Collision detection Piotr Fulma«ski Wydziaª Matematyki i Informatyki, Uniwersytet Šódzki, Polska 19 pa¹dziernika 2015 Table of contents Collision in games Algorithms to detect collision in games depend

More information

improving raytracing speed

improving raytracing speed ray tracing II computer graphics ray tracing II 2006 fabio pellacini 1 improving raytracing speed computer graphics ray tracing II 2006 fabio pellacini 2 raytracing computational complexity ray-scene intersection

More information

From Vertices To Fragments-1

From Vertices To Fragments-1 From Vertices To Fragments-1 1 Objectives Clipping Line-segment clipping polygon clipping 2 Overview At end of the geometric pipeline, vertices have been assembled into primitives Must clip out primitives

More information

Real Time Cloth Simulation

Real Time Cloth Simulation Real Time Cloth Simulation Sebastian Olsson (81-04-20) Mattias Stridsman (78-04-13) Linköpings Universitet Norrköping 2004-05-31 Table of contents Introduction...3 Spring Systems...3 Theory...3 Implementation...4

More information

Animation. Computer Graphics COMP 770 (236) Spring Instructor: Brandon Lloyd 4/23/07 1

Animation. Computer Graphics COMP 770 (236) Spring Instructor: Brandon Lloyd 4/23/07 1 Animation Computer Graphics COMP 770 (236) Spring 2007 Instructor: Brandon Lloyd 4/23/07 1 Today s Topics Interpolation Forward and inverse kinematics Rigid body simulation Fluids Particle systems Behavioral

More information

Simulation in Computer Graphics Space Subdivision. Matthias Teschner

Simulation in Computer Graphics Space Subdivision. Matthias Teschner Simulation in Computer Graphics Space Subdivision Matthias Teschner Outline Introduction Uniform grid Octree and k-d tree BSP tree University of Freiburg Computer Science Department 2 Model Partitioning

More information

Volumetric Particle Separating Planes for Collision Detection

Volumetric Particle Separating Planes for Collision Detection Volumetric Particle Separating Planes for Collision Detection by Brent M. Dingle Fall 2004 Texas A&M University Abstract In this paper we describe a method of determining the separation plane of two objects

More information

Cognitive Robotics Robot Motion Planning Matteo Matteucci

Cognitive Robotics Robot Motion Planning Matteo Matteucci Cognitive Robotics Robot Motion Planning Robot Motion Planning eminently necessary since, by definition, a robot accomplishes tasks by moving in the real world. J.-C. Latombe (1991) Robot Motion Planning

More information

MSBVH: An Efficient Acceleration Data Structure for Ray Traced Motion Blur

MSBVH: An Efficient Acceleration Data Structure for Ray Traced Motion Blur MSBVH: An Efficient Acceleration Data Structure for Ray Traced Motion Blur Leonhard Grünschloß Martin Stich Sehera Nawaz Alexander Keller August 6, 2011 Principles of Accelerated Ray Tracing Hierarchical

More information

Platform Games Drawing Sprites & Detecting Collisions

Platform Games Drawing Sprites & Detecting Collisions Platform Games Drawing Sprites & Detecting Collisions Computer Games Development David Cairns Contents Drawing Sprites Collision Detection Animation Loop Introduction 1 Background Image - Parallax Scrolling

More information

Collision handling: detection and response

Collision handling: detection and response Collision handling: detection and response Collision handling overview Detection Discrete collision detection Convex polygon intersection test General polygon intersection test Continuous collision detection

More information

Robot Motion Control Matteo Matteucci

Robot Motion Control Matteo Matteucci Robot Motion Control Open loop control A mobile robot is meant to move from one place to another Pre-compute a smooth trajectory based on motion segments (e.g., line and circle segments) from start to

More information

Learning Objectives. c D. Poole and A. Mackworth 2010 Artificial Intelligence, Lecture 3.5, Page 1

Learning Objectives. c D. Poole and A. Mackworth 2010 Artificial Intelligence, Lecture 3.5, Page 1 Learning Objectives At the end of the class you should be able to: justify why depth-bounded search is useful demonstrate how iterative-deepening works for a particular problem demonstrate how depth-first

More information

Collision Detection based on Spatial Partitioning

Collision Detection based on Spatial Partitioning Simulation in Computer Graphics Collision Detection based on Spatial Partitioning Matthias Teschner Computer Science Department University of Freiburg Outline introduction uniform grid Octree and k-d tree

More information

The Traditional Graphics Pipeline

The Traditional Graphics Pipeline Last Time? The Traditional Graphics Pipeline Participating Media Measuring BRDFs 3D Digitizing & Scattering BSSRDFs Monte Carlo Simulation Dipole Approximation Today Ray Casting / Tracing Advantages? Ray

More information

1. Mesh Coloring a.) Assign unique color to each polygon based on the polygon id.

1. Mesh Coloring a.) Assign unique color to each polygon based on the polygon id. 1. Mesh Coloring a.) Assign unique color to each polygon based on the polygon id. Figure 1: The dragon model is shown rendered using a coloring scheme based on coloring each triangle face according to

More information

Page 1. Area-Subdivision Algorithms z-buffer Algorithm List Priority Algorithms BSP (Binary Space Partitioning Tree) Scan-line Algorithms

Page 1. Area-Subdivision Algorithms z-buffer Algorithm List Priority Algorithms BSP (Binary Space Partitioning Tree) Scan-line Algorithms Visible Surface Determination Visibility Culling Area-Subdivision Algorithms z-buffer Algorithm List Priority Algorithms BSP (Binary Space Partitioning Tree) Scan-line Algorithms Divide-and-conquer strategy:

More information

To Do. History of Computer Animation. These Lectures. 2D and 3D Animation. Computer Animation. Foundations of Computer Graphics (Spring 2010)

To Do. History of Computer Animation. These Lectures. 2D and 3D Animation. Computer Animation. Foundations of Computer Graphics (Spring 2010) Foundations of Computer Graphics (Spring 2010) CS 184, Lecture 24: Animation http://inst.eecs.berkeley.edu/~cs184 To Do Submit HW 4 (today) Start working on HW 5 (can be simple add-on) Many slides courtesy

More information

COLLISION DETECTION FOR VIRTUAL PROTOTYPING ENVIRONMENTS

COLLISION DETECTION FOR VIRTUAL PROTOTYPING ENVIRONMENTS XIII ADM - XV INGEGRAF International Conference on TOOLS AND METHODS EVOLUTION IN ENGINEERING DESIGN Cassino, June 3th, 2003 Napoli, June 4 th and June 6 th, 2003 Salerno, June 5 th, 2003 COLLISION DETECTION

More information

CSE 167: Introduction to Computer Graphics Lecture #19: Wrapping Up. Jürgen P. Schulze, Ph.D. University of California, San Diego Fall Quarter 2017

CSE 167: Introduction to Computer Graphics Lecture #19: Wrapping Up. Jürgen P. Schulze, Ph.D. University of California, San Diego Fall Quarter 2017 CSE 167: Introduction to Computer Graphics Lecture #19: Wrapping Up Jürgen P. Schulze, Ph.D. University of California, San Diego Fall Quarter 2017 Announcements TA evaluations CAPE Final project blog entries

More information

Ray Tracing III. Wen-Chieh (Steve) Lin National Chiao-Tung University

Ray Tracing III. Wen-Chieh (Steve) Lin National Chiao-Tung University Ray Tracing III Wen-Chieh (Steve) Lin National Chiao-Tung University Shirley, Fundamentals of Computer Graphics, Chap 10 Doug James CG slides, I-Chen Lin s CG slides Ray-tracing Review For each pixel,

More information

Objects DO overlap. Objects DO NOT overlap. No calculations needed.

Objects DO overlap. Objects DO NOT overlap. No calculations needed. Physically Based Modeling for Interactive Simulation and Games Scribe Notes for the lecture on February 23rd Collision Detection Spring 2011 Recep Doga Siyli Collision detection involves "computational

More information

Math 126 Final Examination Autumn CHECK that your exam contains 9 problems on 10 pages.

Math 126 Final Examination Autumn CHECK that your exam contains 9 problems on 10 pages. Math 126 Final Examination Autumn 2016 Your Name Your Signature Student ID # Quiz Section Professor s Name TA s Name CHECK that your exam contains 9 problems on 10 pages. This exam is closed book. You

More information

Spatial Data Structures for Computer Graphics

Spatial Data Structures for Computer Graphics Spatial Data Structures for Computer Graphics Page 1 of 65 http://www.cse.iitb.ac.in/ sharat November 2008 Spatial Data Structures for Computer Graphics Page 1 of 65 http://www.cse.iitb.ac.in/ sharat November

More information

Kinematics: Intro. Kinematics is study of motion

Kinematics: Intro. Kinematics is study of motion Kinematics is study of motion Kinematics: Intro Concerned with mechanisms and how they transfer and transform motion Mechanisms can be machines, skeletons, etc. Important for CG since need to animate complex

More information

Spring 2010: Lecture 9. Ashutosh Saxena. Ashutosh Saxena

Spring 2010: Lecture 9. Ashutosh Saxena. Ashutosh Saxena CS 4758/6758: Robot Learning Spring 2010: Lecture 9 Why planning and control? Video Typical Architecture Planning 0.1 Hz Control 50 Hz Does it apply to all robots and all scenarios? Previous Lecture: Potential

More information

Without fully opening the exam, check that you have pages 1 through 11.

Without fully opening the exam, check that you have pages 1 through 11. Name: Section: Recitation Instructor: INSTRUCTIONS Fill in your name, etc. on this first page. Without fully opening the exam, check that you have pages 1 through 11. Show all your work on the standard

More information

Geometric data structures:

Geometric data structures: Geometric data structures: Machine Learning for Big Data CSE547/STAT548, University of Washington Sham Kakade Sham Kakade 2017 1 Announcements: HW3 posted Today: Review: LSH for Euclidean distance Other

More information

Spatial Data Structures

Spatial Data Structures Spatial Data Structures Hierarchical Bounding Volumes Regular Grids Octrees BSP Trees Constructive Solid Geometry (CSG) [Angel 9.10] Outline Ray tracing review what rays matter? Ray tracing speedup faster

More information