I am working on a trajectory clustering algorithm (in C++) and one of the steps required in this algorithm is to take a set of 3d line segments (D), and for each line segment (L) in D, to calculate an epsilon neighborhood for it to see which other line segments are close to it.
All of the research I have done returns how to do epsilon neighboodhoods with respect to points but not line segments. How would I go about solving this problem?