On collision-free placements of simplices and the closest pair of lines in 3-space
| Author(s) : | Marco Pellegrini, |
| Publisher : | N/A |
| Publication Date : | 1994 |
| ISSN : | N/A |
| Abstract : | We consider the problem of detecting efficiently whether a query simplex is collisionfree among polyhedral obstacles. If n is the number of vertices, edges and faces of the polyhedral obstacles, and m is the amount of storage we allocate for the data structure (n, |