Abstract
Topological Walk is an algorithm that can sweep an arrangement of n lines in O(n2) time and O(n) space. This paper revisits Topological Walk to give its new interpretation in contrast with Topological Sweep. We also survey applications of Topological Walk to make the distinction clearer.
| Original language | English |
|---|---|
| Pages (from-to) | 751-756 |
| Number of pages | 6 |
| Journal | IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences |
| Volume | E81-A |
| Issue number | 5 |
| Publication status | Published - 1998 Jan 1 |
Keywords
- Algorithm
- Arrangement of lines
- Computational geometry
- Degeneracy
- Duality transform
ASJC Scopus subject areas
- Signal Processing
- Computer Graphics and Computer-Aided Design
- Electrical and Electronic Engineering
- Applied Mathematics