Stable 6-DOF Haptic Rendering with Inner Sphere Trees René Weller, Gabriel Zachmann Clausthal University, Germany IDETC/CIE.

Slides:



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

Instructor Notes Lecture discusses parallel implementation of a simple embarrassingly parallel nbody algorithm We aim to provide some correspondence between.
The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL CULLIDE: Interactive Collision Detection Between Complex Models in Large Environments using Graphics Hardware.
Sven Woop Computer Graphics Lab Saarland University
Christian Lauterbach COMP 770, 2/16/2009. Overview  Acceleration structures  Spatial hierarchies  Object hierarchies  Interactive Ray Tracing techniques.
Restart Trail for Stackless BVH Traversal Samuli Laine NVIDIA Research.
Visibility Culling using Hierarchical Occlusion Maps Hansong Zhang, Dinesh Manocha, Tom Hudson, Kenneth E. Hoff III Presented by: Chris Wassenius.
DESIGN OF A GENERIC PATH PATH PLANNING SYSTEM AILAB Path Planning Workgroup.
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.
An’s slides. Wrapped Bounding Sphere Hierarchy for Necklaces Fixed hierarchical structure.
Haptic Rendering using Simplification Comp259 Sung-Eui Yoon.
Collision Detection CSE 191A: Seminar on Video Game Programming Lecture 3: Collision Detection UCSD, Spring, 2003 Instructor: Steve Rotenberg.
Accurate Non-Iterative O( n ) Solution to the P n P Problem CVLab - Ecole Polytechnique Fédérale de Lausanne Francesc Moreno-Noguer Vincent Lepetit Pascal.
Bounding Volume Hierarchy “Efficient Distance Computation Between Non-Convex Objects” Sean Quinlan Stanford, 1994 Presented by Mathieu Brédif.
GPU Proximity Queries with Swept Sphere Volumes COMP Robotics Project Proposal Qi Mo.
UNC at CHAPEL HILL & Ewha Womans University Generalized Penetration Depth Computation Liang-Jun Zhang Gokul Varadhan Dinesh Manocha Dept of Computer Sci.
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.
Path Planning on a Compressed Terrain Daniel M. Tracy, W. Randolph Franklin, Barbara Cutler, Franklin T. Luk, Marcus Andrade, Jared Stookey Rensselaer.
Overview Class #10 (Feb 18) Assignment #2 (due in two weeks) Deformable collision detection Some simulation on graphics hardware... –Thursday: Cem Cebenoyan.
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.
Interpolation Snakes Work by Silviu Minut. Ultrasound image has noisy and broken boundaries Left ventricle of dog heart Geodesic contour moves to smoothly.
Haptic Cloth Rendering 6th Dutch-Belgian Haptics Meeting TUDelft, 21 st June 2006 Lode Vanacken Expertise centre for Digital Media (EDM) Hasselt University.
Proximity and Deformation Leonidas Guibas Stanford University “Tutto cambia perchè nulla cambi” T. di Lampedusa, Il Gattopardo (1860+)
The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL Collision Detection for Deformable Objects Xin Huang 16/10/2007.
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.
Efficient Maintenance and Self-Collision Testing for Kinematic Chains Itay Lotan Fabian Schwarzer Dan Halperin Jean-Claude Latombe.
Voxelized Shadow Volumes Chris Wyman Department of Computer Science University of Iowa High Performance Graphics 2011.
FastLSM: Fast Lattice Shape Matching for Robust Real-Time Deformation Alec RiversDoug James Cornell University.
Introduction to Haptic Rendering JPL - Virtual Environments Laboratory California Institute of Technology ( Cagatay Basdogan,
Computer-Aided Design and Manufacturing Laboratory: 3D Minkowski sum computation Sara McMains UC Berkeley.
A Fast Simulation Method Using Overlapping Grids for Interactions between Smoke and Rigid Objects Yoshinori Dobashi (Hokkaido University) Tsuyoshi Yamamoto.
Graph Abstraction for Simplified Proofreading of Slice-based Volume Segmentation Ronell Sicat 1, Markus Hadwiger 1, Niloy Mitra 1,2 1 King Abdullah University.
9th International Fall Workshop VISION, MODELING, AND VISUALIZATION 2004 November , 2004 Stanford (California), USA Poster Session 4 Geometry Processing.
Triangular Mesh Decimation
Quick-CULLIDE: Efficient Inter- and Intra- Object Collision Culling using Graphics Hardware Naga K. Govindaraju, Ming C. Lin, Dinesh Manocha University.
Interactive Visualization of Exceptionally Complex Industrial CAD Datasets Andreas Dietrich Ingo Wald Philipp Slusallek Computer Graphics Group Saarland.
Saarland University, Germany B-KD Trees for Hardware Accelerated Ray Tracing of Dynamic Scenes Sven Woop Gerd Marmitt Philipp Slusallek.
Collision and Proximity Queries Dinesh Manocha Department of Computer Science University of North Carolina
Click to edit Master title style HCCMeshes: Hierarchical-Culling oriented Compact Meshes Tae-Joon Kim 1, Yongyoung Byun 1, Yongjin Kim 2, Bochang Moon.
A Computationally Efficient Framework for Modeling Soft Body Impact Sarah F. Frisken and Ronald N. Perry Mitsubishi Electric Research Laboratories.
University of Montreal & iMAGIS A Light Hierarchy for Fast Rendering of Scenes with Many Lights E. Paquette, P. Poulin, and G. Drettakis.
Computer Game Design and Development
Presented by Paul Phipps
PhD Defense Emanuele Ruffaldi
01/28/09Dinesh Manocha, COMP770 Visibility Computations Visible Surface Determination Visibility Culling.
Interactive Continuous Collision Detection for Polygon Soups Xin Huang 11/20/2007.
CHC ++: Coherent Hierarchical Culling Revisited Oliver Mattausch, Jiří Bittner, Michael Wimmer Institute of Computer Graphics and Algorithms Vienna University.
APE'07 IV INTERNATIONAL CONFERENCE ON ADVANCES IN PRODUCTION ENGINEERING June 2007 Warsaw, Poland M. Nowakiewicz, J. Porter-Sobieraj Faculty of.
1 The Method of Precomputing Triangle Clusters for Quick BVH Builder and Accelerated Ray Tracing Kirill Garanzha Department of Software for Computers Bauman.
Date of download: 7/8/2016 Copyright © ASME. All rights reserved. From: Graphic Processing Units (GPUs)-Based Haptic Simulator for Dental Implant Surgery.
Stable 6-DOF Haptic Rendering with Inner Sphere Trees
Optimized Continuous Collision Detection for Deformable Triangle Meshes Marco Hutter and Arnulph Fuhrmann WCSG’2007 – 30 January, 2007 – Plzen,
DX11 TECHNIQUES IN HK2207 Takahiro Harada AMD. DX11 TECHNIQUES IN HK2207 Takahiro Harada AMD.
Distance Computation “Efficient Distance Computation Between Non-Convex Objects” Sean Quinlan Stanford, 1994 Presentation by Julie Letchner.
Real-Time Ray Tracing Stefan Popov.
Graceful Degradation Of Collision Handling in Physically Based Animation John Dingliana , Carol O’ Sullivan.
Accelerated Single Ray Tracing for Wide Vector Units
Iterative Optimization
Adaptive Interpolation of Multidimensional Scaling
Performance Evaluation of the Parallel Fast Multipole Algorithm Using the Optimal Effectiveness Metric Ioana Banicescu and Mark Bilderback Department of.
Motion in Real and Virtual Worlds
Sara McMains UC Berkeley
David Johnson Cs6360 – Virtual Reality
GPAT – Chapter 7 Physics.
Presentation transcript:

Stable 6-DOF Haptic Rendering with Inner Sphere Trees René Weller, Gabriel Zachmann Clausthal University, Germany IDETC/CIE 2009, Aug-Sep 2009, San Diego, CA

Related Work Our Approach Details Collision Response Results Extensions Conclusion BVHs vs Voxels  BVHs  Easy to build  Fast, robust and exact -Complicated to compute penetration depth -Not fast enough for haptic applications  Voxel based algorithms  Fast enough for haptic interactions  Independent of object complexity -Memory consuming -Aliasing artifacts Mendoza et al, 2006],[ [Zhang et al, 2007], … [McNeely et al., 1999] Related Work Our Approach Details Collision Response Results Extensions Conclusion

Goal: Keep the Best of Both Worlds  Keep a single consistent data structures for moving and fixed objects  Near constant running time  Low memory usage  Continuous feedback forces Related Work Our Approach Details Collision Response Results Extensions Conclusion

Our Novel Approach: Inner Sphere Trees  Fill the object with non-overlapping spheres  Build sphere hierarchy  Support for approximative separation distance and penetration volume  Penetration volume defines a new approach for penalty forces Related Work Our Approach Details Collision Response Results Extensions Conclusion

Sphere Packing Related Work Our Approach Details Collision Response Results Extensions Conclusion

Hierarchy Creation Related Work Our Approach Details Collision Response Results Extensions Conclusion

Batch Neural Gas Clustering w1w1 w2w2 Related Work Our Approach Details Collision Response Results Extensions Conclusion

Hierarchy Creation in 3D Related Work Our Approach Details Collision Response Results Extensions Conclusion

Penetration volume = v 1 + v 2 Penetration volume = 0Penetration volume = v 1 BVH Traversal: Penetration Volume Queries v1v1 v2v2 Related Work Our Approach Details Collision Response Results Extensions Conclusion

distance < d 1 d1d1 BVH Traversal: Proximity Queries Related Work Our Approach Details Collision Response Results Extensions Conclusion

 (s i, s j ) = (P i,j – C m ) £ f i f i blue =(s j red Å s i blue )(–n i blue )  total =   (s i, s j )f total blue =  f i blue  = (P c – C m ) £ f n i blue -n i blue s j red Å s i blue Collision Response Part 1: Forces s 2 red Å s 2 blue Collision Response Part 2: Torques P i,j Related Work Our Approach Details Collision Response Results Extensions Conclusion

Results: Forces / Torques Related Work Our Approach Details Collision Response Results Extensions Conclusion

Results: Penetration Volume Related Work Our Approach Details Collision Response Results Extensions Conclusion

Results: Proximity-Queries Related Work Our Approach Details Collision Response Results Extensions Conclusion

Multithreaded Time Critical Approach Haptic Simulation Thread Collision Detection Thread Visual Rendering Thread Positons Separation List Positions Related Work Our Approach Details Collision Response Results Extensions Conclusion

Time Critical Traversal: Separation List Related Work Our Approach Details Collision Response Results Extensions Conclusion

Expected Overlap Volume Related Work Our Approach Details Collision Response Results Extensions Conclusion

Applications  12 full dynamically moving objects  3.5M of triangles  1KHz simulation rate  Old Pentium IV 3GHz computer Related Work Our Approach Details Collision Response Results Extensions Conclusion

Conclusions  Inner Sphere Trees with support for  Proximity queries  Penetration volume computation  Independent of object complexity  Fast run time with high accuracy  Accuracy loss < 1% at 1 KHz refresh rate  Stable multithreaded time critical algorithm  BVH-like low memory usage and consistency  Continuous forces and torques => No Aliasing Related Work Our Approach Details Collision Response Results Extensions Conclusion

Future Work  Derive exact error bounds to get the optimal number of inner spheres  GPU implementation  Other bounding volumes  Other objects  Thin sheets  Deformable objects Related Work Our Approach Details Collision Response Results Extensions Conclusion

Acknowledgments  DFG grant ZA292/1-1  BMBF grant Avilus / 01 IM U.