Graceful Degradation Of Collision Handling in Physically Based Animation John Dingliana , Carol O’ Sullivan.

Slides:



Advertisements
Similar presentations
2.6. B OUNDING V OLUME H IERARCHIES Overview of different forms of bounding volume hierarchy.
Advertisements

Simulation of Feedback Scheduling Dan Henriksson, Anton Cervin and Karl-Erik Årzén Department of Automatic Control.
Christian Lauterbach COMP 770, 2/16/2009. Overview  Acceleration structures  Spatial hierarchies  Object hierarchies  Interactive Ray Tracing techniques.
Greta YorshEran YahavMartin Vechev IBM Research. { ……………… …… …………………. ……………………. ………………………… } P1() Challenge: Correct and Efficient Synchronization { ……………………………
Optimized Stencil Shadow Volumes
Zhao Dong 1, Jan Kautz 2, Christian Theobalt 3 Hans-Peter Seidel 1 Interactive Global Illumination Using Implicit Visibility 1 MPI Informatik Germany 2.
©Ian Sommerville 2006Software Engineering, 8th edition. Chapter 4 Slide 1 Software Processes.
2.1. C OLLISION D ETECTION Overview. Collision detection is used within many types of application, e.g. from robotics, through engineering simulations,
Visibility Culling. Back face culling View-frustrum culling Detail culling Occlusion culling.
Week 14 - Monday.  What did we talk about last time?  Bounding volume/bounding volume intersections.
Haptic Rendering using Simplification Comp259 Sung-Eui Yoon.
Quasi-Rigid Objects in Contact Mark Pauly Dinesh PaiLeo Guibas Stanford UniversityRutgers UniversityStanford University.
Bounding Volume Hierarchy “Efficient Distance Computation Between Non-Convex Objects” Sean Quinlan Stanford, 1994 Presented by Mathieu Brédif.
Scenegraph. Scenegraph Nodes - all implement a run function Leaf/Geo Nodes - typedefs of sgNode superclass –Poly Mesh A geo node that stores a list of.
RT 08 Efficient Clustered BVH Update Algorithm for Highly-Dynamic Models Symposium on Interactive Ray Tracing 2008 Los Angeles, California Kirill Garanzha.
Adapted from: CULLIDE: Interactive Collision Detection Between Complex Models in Large Environments using Graphics Hardware Naga K. Govindaraju, Stephane.
Computer Engineering 203 R Smith Communications 1/ What is communications? Correctly conveying information and understanding from one individual.
Semiautomatic Simplification “semisimp” by Benjamin Watson and Gong Li Presented by John Cihocki.
Haptic Cloth Rendering 6th Dutch-Belgian Haptics Meeting TUDelft, 21 st June 2006 Lode Vanacken Expertise centre for Digital Media (EDM) Hasselt University.
The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL Constraint-Based Motion Planning using Voronoi Diagrams Maxim Garber and Ming C. Lin Department of Computer.
Efficient Distance Computation between Non-Convex Objects by Sean Quinlan presented by Teresa Miller CS 326 – Motion Planning Class.
1 Advanced Scene Management System. 2 A tree-based or graph-based representation is good for 3D data management A tree-based or graph-based representation.
1 Algorithm Design Techniques Greedy algorithms Divide and conquer Dynamic programming Randomized algorithms Backtracking.
Computer graphics & visualization Collision Detection – Narrow Phase.
INTERACTION TECHNIQUES Collision Detection and Other Interactions Collision Detection and Other Interactions.
Lecture VII Rigid Body Dynamics CS274: Computer Animation and Simulation.
SOFA : Design for Parallel Computations Jérémie Allard.
CSE 381 – Advanced Game Programming Quickhull and GJK.
On-line Space Sculpturing for 3D Shape Manipulation
Timothy Reeves: Presenter Marisa Orr, Sherrill Biggers Evaluation of the Holistic Method to Size a 3-D Wheel/Soil Model.
GPU Broad Phase Collision Detection GPU Graphics Gary J. Katz University of Pennsylvania CIS 665 Adapted from articles taken from GPU Gems III.
Interpretation Environments and Evaluation. CS 354 Spring Translation Stages Lexical analysis (scanning) Parsing –Recognizing –Building parse tree.
12/4/2001CS 638, Fall 2001 Today Managing large numbers of objects Some special cases.
PRESENTED BY – GAURANGI TILAK SHASHANK AGARWAL Collision Detection.
A Cyclic-Executive-Based QoS Guarantee over USB Chih-Yuan Huang,Li-Pin Chang, and Tei-Wei Kuo Department of Computer Science and Information Engineering.
CIS 350 – I Game Programming Instructor: Rolf Lakaemper.
Hierarchical Penumbra Casting Samuli Laine Timo Aila Helsinki University of Technology Hybrid Graphics, Ltd.
Comparison of Collision Detection Algorithms Tony Young M.Math Candidate July 19th, 2004.
Computer Game Design and Development
Stable 6-DOF Haptic Rendering with Inner Sphere Trees René Weller, Gabriel Zachmann Clausthal University, Germany IDETC/CIE.
PMR: Point to Mesh Rendering, A Feature-Based Approach Tamal K. Dey and James Hudson
Approach Outline Polygonal-Functional Hybrids for Computer Animation and Games The modern world of computer graphics is mostly dominated by polygonal models.
LODManager A framework for rendering multiresolution models in real-time applications J. Gumbau O. Ripollés M. Chover.
CS274 Spring 01 Lecture 7 Copyright © Mark Meyer Lecture VII Rigid Body Dynamics CS274: Computer Animation and Simulation.
Framsticks physics © Szymon Ulatowski. Simulation goals Physics-based: create real-world feeling to intuitively understand behaviors Not necessarily very.
Advanced Games Development Game Physics CO2301 Games Development 1 Week 19.
Multiple Passes of the FreeBSD Device Tree
2D Simulation of Rigid Bodies
Bounding Volume Hierarchies and Spatial Partitioning
Stable 6-DOF Haptic Rendering with Inner Sphere Trees
Automatic Network Protocol Analysis
Distance Computation “Efficient Distance Computation Between Non-Convex Objects” Sean Quinlan Stanford, 1994 Presentation by Julie Letchner.
Software Processes (a)
Bounding Volume Hierarchies and Spatial Partitioning
2.1. Collision Detection Overview.
Analytics for the IoT: A Deep Dive into Algorithms
Fault Tolerance Distributed Web-based Systems
Smita Vijayakumar Qian Zhu Gagan Agrawal
Intelligent Backtracking Algorithms: A Theoretical Evaluation
The Last Lecture COMP 512 Rice University Houston, Texas Fall 2003
by Xiang Mao and Qin Chen
Motion in Real and Virtual Worlds
Intelligent Backtracking Algorithms: A Theoretical Evaluation
Intelligent Backtracking Algorithms: A Theoretical Evaluation
INTERACTION TECHNIQUES
Intelligent Backtracking Algorithms: A Theoretical Evaluation
Intelligent Backtracking Algorithms: A Theoretical Evaluation
Advanced Games Development Game Physics
Intelligent Backtracking Algorithms: A Theoretical Evaluation
Computer Graphics Matrix Hierarchies / Animation
Presentation transcript:

Graceful Degradation Of Collision Handling in Physically Based Animation John Dingliana , Carol O’ Sullivan

Problem Simplification of rendered scenes in real time applications required. Static method of simplification - BAD. Dynamic management of Level Of scene Detail - BETTER. Specifically, varying level of detail associated with collision handling.

Goals Separation of constant time processes and “indeterminate complexity” processes. Allow interruption of “indeterminate complexity” processes. Larger Goal : Deliver “consistent” results even at a lower level of detail.

General Collision Handling Collision Detection : Broad Phase : Coarse volume intersection. Intermediate Phase : Narrow down areas of collision. Narrow Phase : Polygonal intersection tests. Contact Modeling : Extract collision information. State Update.

Collision Detection Every object has a sphere tree.

Collision Detection (contd.) Perform intersection tests, going down the hierarchy of sphere tree. If node is not a leaf node: If intersection found, go down to next level. Else, flag as “true collision” or “no collision”.

Collision Detection-Example

Collision Detection - Variant Models this as an interruptible process. Possible collisions must be treated as true collisions, later. Broad Phase : Perform intersection at root. Narrow Phase : Refine intersections. Polygonal intersections used only on leaf nodes. Deeper sphere tree.

Collision Response Action taken after collision detection. Consists of : Impulse Calculation Contact Modeling

Impulse Calculation Assumptions: Rigid body collision. Frictionless collision. Uses an impulse model to calculate force on intersecting node.

Contact Modeling Determines direction of impulse. Determines point of collision. No backtracking.

Backtracking - Example

State Update Resolves impulses per object. Changes the state of intersecting objects.

Implementation Collision detection phase and the contact modeling phase interleaved. While traversing the sphere tree, populate collision list with intersection information. This process is interruptible.

Implementation (contd.) Collision Number Calculation Response = Of * time of a Time Intersections Single Impulse Variable Constant

Time Scheduler Done per frame. Stage 1: Allots time quota to collision handling process. Stage 2: Monitors time quota for collision detection process. Allocates time quota for impulse calculation and state update phase.

Time Scheduler (contd.) Stage 3: Time quota for collision detection exhausted. Interrupts collision detection process. Transfers control to collision response phase.

Results

Conclusion Introduced an approach to control the level of detail of individual interactions in a complex scene. Especially useful in meeting the demand of real time frame rates.

Context Follow up paper : Perception heuristics guiding the process. Metric for evaluating results. Level-Of-Detail feedback loop – good?