On the bit complexity of minimum link paths: superquadratic algorithms for problems solvable in linear time (1996)

by KS96 S Kahan, J Snoeyink
Venue:In Proc. 12th Annual ACM Symposium on Computational Geometry