Walking on an arrangement topologically

Tetsuo Asano, Leonidas J. Guibas, Takeshi Tokuyama

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationProceedings of the Annual Symposium on Computational Geometry
PublisherAssociation for Computing Machinery
Pages297-306
Number of pages10
ISBN (Print)0897914260
DOIs
Publication statusPublished - 1991 Jun 1
Event7th Annual Symposium on Computational Geometry, SCG 1991 - North Conway, United States
Duration: 1991 Jun 101991 Jun 12

Publication series

NameProceedings of the Annual Symposium on Computational Geometry

Other

Other7th Annual Symposium on Computational Geometry, SCG 1991
CountryUnited States
CityNorth Conway
Period91/6/1091/6/12

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Computational Mathematics

Fingerprint Dive into the research topics of 'Walking on an arrangement topologically'. Together they form a unique fingerprint.

Cite this