How to best store lines in a kd-tree

Question

I know kd-trees are traditionally used to store points, but I want to store lines instead. Would it be best to split the line at every intersection with the splitting of the

Answer 1

Do you have to use a kd-tree? For extended primitives a bv-tree might be more efficient.