Incidence and nearest-neighbor problems for lines in 3-space
Marco Pellegrini · 1992
In the first part of the paper we solve the problem of detecting efficiently if a query simplex is collison-free among polyhedral obstacles. In order to solve this problem we develop new on-line data structures to detect intersections of query halfplanes with sets of lines and segments.