T. Asano et T. Tokuyama, TOPOLOGICAL WALK REVISITED, IEICE transactions on fundamentals of electronics, communications and computer science, E81A(5), 1998, pp. 751-756
Citations number
11
Categorie Soggetti
Engineering, Eletrical & Electronic","Computer Science Hardware & Architecture","Computer Science Information Systems
Topological Walk is an algorithm that can sweep an arrangement of n li
nes in O(n(2)) time and O(n) space. This paper revisits Topological Wa
lk to give its new interpretation in contrast with Topological Sweep.
We also survey applications of Topological Walk to make the distinctio
n clearer.