Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

JGTOOLS
2006

favoriteEmaildiscussreport

80views more JGTOOLS 2006»

A Fast Method for Local Penetration Depth Computation

13 years 4 months ago

A Fast Method for Local Penetration Depth Computation

Download gamma.cs.unc.edu

In this appendix, we provide some details on the data structures used to cluster the intersection segments. Although the data structures are fairly classical (a heap, a grid and a hashtable), we pay attention to the implementation details to ensure that the segment clustering is performed in almost linear time. 1 Intersection segment clustering

Stephane Redon, Ming C. Lin

Real-time Traffic

Data Structures | Grid | Intersection Segment | JGTOOLS 2006 |

claim paper

Related Content

» A Fast and Practical Algorithm for Generalized Penetration Depth Computation

» Consistent penetration depth estimation for deformable collision response

» SixDegreeofFreedom Haptic Display Using Localized Contact Computations

» Energybased 6DOF penetration depth computation for penaltybased haptic rendering algorithm...

» Generalized penetration depth computation

» DEEP DualSpace Expansion for Estimating Penetration Depth Between Convex Polytopes

» Accelerated Proximity Queries for Haptic Rendering of Deformable Models

» PointBased Minkowski Sum Boundary

» Fast Cobstacle Query Computation for Motion Planning

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2006
Where	JGTOOLS
Authors	Stephane Redon, Ming C. Lin

Comments (0)