Linear-time algorithms for geometric graphs with sublinearly many crossings.

David Eppstein, Michael T. Goodrich, Darren Strash

Browse the full SODA paper archive.