Walking on an arrangement topologically

Tetsuo Asano, Leonidas J. Guibas, Takeshi Tokuyama

研究成果: Conference contribution

4 被引用数 (Scopus)

抄録

We present topological walk, which is an on-line algorithm to give a walk of an arrangement. Here, a walk is a list of cells of the arrangement in which consecutive cells are adjacent to each other. The algorithm is input-sensitive; in precise, given an arrangement of n lines in a convex region which contains K cells, a walk is given in O(K+ n log n) time and O(n) working space. Further, we can efficiently solve several optimal cell finding problems applying topological walk.

本文言語English
ホスト出版物のタイトルProceedings of the Annual Symposium on Computational Geometry
出版社Association for Computing Machinery
ページ297-306
ページ数10
ISBN(印刷版)0897914260
DOI
出版ステータスPublished - 1991 6 1
イベント7th Annual Symposium on Computational Geometry, SCG 1991 - North Conway, United States
継続期間: 1991 6 101991 6 12

出版物シリーズ

名前Proceedings of the Annual Symposium on Computational Geometry

Other

Other7th Annual Symposium on Computational Geometry, SCG 1991
国/地域United States
CityNorth Conway
Period91/6/1091/6/12

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • 幾何学とトポロジー
  • 計算数学

フィンガープリント

「Walking on an arrangement topologically」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル