A Fast Method for Local Penetration Depth Computation

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

• Type: Journal
• Year: 2006
• Where: JGTOOLS
• Authors: Stephane Redon, Ming C. Lin
• Keywords: Data Structures, Grid, Intersection Segment, JGTOOLS 2006