Work

Linear-time algorithms for geometric graphs with sublinearly many crossings