Topological Walk Revisited(Special Section on Discrete Mathematics and Its Applications)
スポンサーリンク
概要
- 論文の詳細を見る
Topological Walk is an algorithm that can sweep an arrangement of n lines in O(n^2)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.
- 社団法人電子情報通信学会の論文
- 1998-05-25
著者
-
Tokuyama Takeshi
Tokyo Research Laboratory, IBM Japan
-
Asano Tetsuo
School Of Information Science Jaist
-
Tokuyama Takeshi
Tokyo Research Laboratory Ibm Japan
関連論文
- Voronoi Diagrams with Respect to Criteria on Vision Information
- Space-Efficient Algorithm for Image Rotation
- Constant-Work-Space Image Scan with a Given Angle
- Inserting Points Uniformly at Every Instance
- On Detecting Digital Line Components in a Binary Image
- Digital Curve Approximation with Length Evaluation
- FOREWORD (Special Section on Discrete Mathematics and Its Applications)
- Topological Walk Revisited(Special Section on Discrete Mathematics and Its Applications)
- A Linear Time Algorithm for Binary Fingerprint Image Denoising Using Distance Transform
- Digital Halftoning Algorithm Based on Random Space-Filling Curve
- Arranging Fewest Possible Probes to Detect a Hidden Object with Industrial Application
- Digital Halftoning: Algorithm Engineering Challenges
- A generating function of strict Gelfand patterns and some formulas on characters of general linear groups
- Algorithmic Evaluation of Line Detection Problem
- Halftoning Through Optimization of Restored Images : A New Approach with Hardware Acceleration
- NP-completeness of generalized Kaboozle
- A Small-Space Algorithm for Removing Small Connected Components from a Binary Image