Topological Walk Revisited

摘要

Topological Walk is an algorithm that can sweep an arrangement ofn lines in O(n~2) time and O(n) space. This paper revisitsTopological Walk to give its new interpretation in contrast withTopological Sweep. We also survey applications of Topological Walk tomake the distinction clearer.