6 citations · 11 across the 8 of their papers we have counts for
1 paper · 2 filters
Frank Sottile, Thorsten Theobald
We first review some topics in the classical computational geometry of lines, in particular the O(n^{3+ε}) bounds for the combinatorial complexity of the set of lines in R^3 intera…