GPU Proximity Queries with Swept Sphere Volumes COMP 790-058 Robotics Project Proposal Qi Mo.

Slides:



Advertisements
Similar presentations
The Gilbert-Johnson-Keerthi (GJK) Algorithm
Advertisements

Christian Lauterbach COMP 770, 2/16/2009. Overview  Acceleration structures  Spatial hierarchies  Object hierarchies  Interactive Ray Tracing techniques.
Complete Motion Planning
Collision Detection CSCE /60 What is Collision Detection?  Given two geometric objects, determine if they overlap.  Typically, at least one of.
Collision Detection and Resolution Zhi Yuan Course: Introduction to Game Development 11/28/
Computer graphics & visualization Collisions. computer graphics & visualization Simulation and Animation – SS07 Jens Krüger – Computer Graphics and Visualization.
Geometry Primer Lines and rays Planes Spheres Frustums Triangles Polygon Polyhedron.
A Survey of Cloth Simulation Techniques Presented by Mave T. Houston for Comp Computational Geometry Fall 1998.
Geometric Representations & Collision Detection Kris Hauser I400/B659: Intelligent Robotics Spring 2014.
Proximity Computations between Noisy Point Clouds using Robust Classification 1 Jia Pan, 2 Sachin Chitta, 1 Dinesh Manocha 1 UNC Chapel Hill 2 Willow Garage.
FASTCD: Fracturing-Aware Stable Collision Detection Jae-Pil Heo 1, Joon-Kyung Seong 1, Duksu Kim 1, Miguel A. Otaduy 2, Jeong-Mo Hong 3, Min Tang 4, and.
Algorithmic Robotics and Motion Planning Dan Halperin Tel Aviv University Fall 2006/7 Dynamic Maintenance and Self-Collision Testing for Large Kinematic.
An’s slides. Wrapped Bounding Sphere Hierarchy for Necklaces Fixed hierarchical structure.
Review Methods for convex polytopes See video demonstration
GPU Hierarchies for Hair Simulation Qi Mo COMP 768 course project proposal.
Adapted from: CULLIDE: Interactive Collision Detection Between Complex Models in Large Environments using Graphics Hardware Naga K. Govindaraju, Stephane.
CS 326 A: Motion Planning robotics.stanford.edu/~latombe/cs326/2004/index.htm Collision Detection and Distance Computation: Feature Tracking Methods.
The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL Continuous Collision Detection David Knott COMP 259 class presentation.
Overview Class #10 (Feb 18) Assignment #2 (due in two weeks) Deformable collision detection Some simulation on graphics hardware... –Thursday: Cem Cebenoyan.
Dynamic Maintenance and Self Collision Testing for Large Kinematic Chains Lotan, Schwarzer, Halperin, Latombe.
Ray Tracing Dynamic Scenes using Selective Restructuring Sung-eui Yoon Sean Curtis Dinesh Manocha Univ. of North Carolina at Chapel Hill Lawrence Livermore.
CS 326 A: Motion Planning robotics.stanford.edu/~latombe/cs326/2004/index.htm Collision Detection and Distance Computation.
OBBTree: A Hierarchical Structure for Rapid Interference Detection Gottschalk, M. C. Lin and D. ManochaM. C. LinD. Manocha Department of Computer Science,
Algorithm for Fast MC Simulation of Proteins Itay Lotan Fabian Schwarzer Dan Halperin Jean-Claude Latombe.
Bounding Volume Hierarchies and Spatial Partitioning Kenneth E. Hoff III COMP-236 lecture Spring 2000.
Proximity Queries Using Spatial Partitioning & Bounding Volume Hierarchy Dinesh Manocha Department of Computer Science University of North Carolina at.
Acceleration on many-cores CPUs and GPUs Dinesh Manocha Lauri Savioja.
The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL Collision Detection for Deformable Objects Xin Huang 16/10/2007.
Collision Detection and Distance Computation CS 326A: Motion Planning.
CS 326 A: Motion Planning Collision Detection and Distance Computation.
Apex Point Map for Constant-Time Bounding Plane Approximation Samuli Laine Tero Karras NVIDIA.
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.
CS 326A: Motion Planning ai.stanford.edu/~latombe/cs326/2007/index.htm Collision Detection and Distance Computation.
CS 326A: Motion Planning ai.stanford.edu/~latombe/cs326/2007/index.htm Collision Detection and Distance Computation.
Collision Detection David Johnson Cs6360 – Virtual Reality.
CS B659: Principles of Intelligent Robot Motion Collision Detection.
Efficient Maintenance and Self-Collision Testing for Kinematic Chains Itay Lotan Fabian Schwarzer Dan Halperin Jean-Claude Latombe.
Fast Proximity Queries for Interactive Walkthroughs Ming C. Lin University of North Carolina at Chapel Hill Presented.
Fast Collision Detection for Deformable Models using Representative-Triangles Sean Curtis 1, Rasmus Tamstorf 2, & Dinesh Manocha 1 I3D 2008 February 15,
High Performance Graphics 2015 Los Angeles, CA High Performance Graphics 2015 Los Angeles, CA HPG 2015 Award Ceremony Petrik Clarberg and Elmar Eisemann.
RACBVHs: Random-Accessible Compressed Bounding Volume Hierarchies Tae-Joon Kim Bochang Moon Duksu Kim Sung-Eui Yoon KAIST (Korea Advanced Institute of.
Quick-CULLIDE: Efficient Inter- and Intra- Object Collision Culling using Graphics Hardware Naga K. Govindaraju, Ming C. Lin, Dinesh Manocha University.
CS B659: Principles of Intelligent Robot Motion Rigid Transformations and Collision Detection.
Collision and Proximity Queries Dinesh Manocha Department of Computer Science University of North Carolina
CIS 350 – I Game Programming Instructor: Rolf Lakaemper.
Click to edit Master title style HCCMeshes: Hierarchical-Culling oriented Compact Meshes Tae-Joon Kim 1, Yongyoung Byun 1, Yongjin Kim 2, Bochang Moon.
Fast BVH Construction on GPUs (Eurographics 2009) Park, Soonchan KAIST (Korea Advanced Institute of Science and Technology)
1 Energy Maintenance for Molecular Simulation kinematics + energy  motion + structure Main computational issue: Proximity computation.
M. Agus F. Bettio E. Gobbetti F. Marton G. Pintore A. Zorcolo CRS4, Visual Computing POLARIS, Ed. 1 C.P. 25 – I Pula (CA) ITALY
Stable 6-DOF Haptic Rendering with Inner Sphere Trees René Weller, Gabriel Zachmann Clausthal University, Germany IDETC/CIE.
Chapter 11 Collision Detection 가상현실 입문 그래픽스 연구실 민성환.
Maximizing Parallelism in the Construction of BVHs, Octrees, and k-d Trees Tero Karras NVIDIA Research.
Presented by Paul Phipps
CULLIDE: Interactive Collision Detection Between Complex Models in Large Environments using Graphics Hardware Presented by Marcus Parker By Naga K. Govindaraju,
David Luebke 3/5/2016 Advanced Computer Graphics Lecture 4: Faster Ray Tracing David Luebke
David Luebke3/12/2016 Advanced Computer Graphics Lecture 3: More Ray Tracing David Luebke
Interactive Continuous Collision Detection for Polygon Soups Xin Huang 11/20/2007.
Fast Collision Detection for Deformable Models using Representative-Triangles Presented by Marcus Parker By Sean Curtis, Rasmus Tamstorf and Dinesh Manocha.
1 Haptic Systems Mohsen Mahvash Lecture 6 17/1/06.
Bounding Volume Hierarchies and Spatial Partitioning
Stable 6-DOF Haptic Rendering with Inner Sphere Trees
Frustum Culling in OpenGL
Collision Detection Spring 2004.
Bounding Volume Hierarchies and Spatial Partitioning
Deformable Collision Detection
Parts of these slides are based on
Cache-Efficient Layouts of BVHs and Meshes
Collision Detection.
Deformable Collision Detection
David Johnson Cs6360 – Virtual Reality
Presentation transcript:

GPU Proximity Queries with Swept Sphere Volumes COMP Robotics Project Proposal Qi Mo

Proximity Query Collision detection, Separation distance computation, Approximate distance, etc. Bounding volume hierarchies (BVHs) Spheres, AABBs, OBBs, etc. Tightness of fit Vs cost of BV pair operation

Swept Sphere Volumes (SSVs) PSS LSS RSS

Prior Work 1. Fast Proximity Queries with Swept Sphere Volumes, Eric Larsen, Stefan Gottschalk, Ming C. Lin, Dinesh Manocha, Proceedings of International Conference on Robotics and Automation, pp , April Fast BVH Construction on GPUs, Christian Lauterbach, Michael Garland, Shubhabrata Sengupta, David Luebke, Dinesh Manocha, In submission RT-DEFORM: Interactive Ray Tracing of Dynamic Scenes Using BVHs, Christian Lauterbach, Sung-Eui Yoon, David Tuft, DInesh Manocha, Proceedings of IEEE Symposium on Interactive Ray Tracing, 2006

Project Summary Extend current GPU collision detection framework – from AABBs to SSVs – from collision detection to distance computation