8 citations · 27 across the 13 of their papers we have counts for
1 paper · 1 filter
Dan Halperin, Sariel Har-Peled, Kurt Mehlhorn +2
Let L be a set of n lines in the plane, not necessarily in general position. We present an efficient algorithm for finding all the vertices of the arrangement A(L) of maximum…