Orthogonal queries in segments and triangles

Takeshi Tokuyama

研究成果: Conference contribution

1 引用 (Scopus)

抜粋

We present an efficient orthogonal query data structure in a set of segments or trianlgles in space. The most important feature of our results is that the efficiency of the data structure is highly dependent on the geometric discrete parameters of the input set, as well as its cardinality.

元の言語English
ホスト出版物のタイトルAlgorithms and Computation - 5th International Symposium, ISAAC 1994, Proceedings
編集者Ding-Zhu Du, Ding-Zhu Du, Xiang-Sun Zhang
出版者Springer Verlag
ページ505-513
ページ数9
ISBN(印刷物)9783540583257
DOI
出版物ステータスPublished - 1994 1 1
イベント5th Annual International Symposium on Algorithms and Computation, ISAAC 1994 - Beijing, China
継続期間: 1994 8 251994 8 27

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
834 LNCS
ISSN(印刷物)0302-9743
ISSN(電子版)1611-3349

Other

Other5th Annual International Symposium on Algorithms and Computation, ISAAC 1994
China
Beijing
期間94/8/2594/8/27

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント Orthogonal queries in segments and triangles' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用

    Tokuyama, T. (1994). Orthogonal queries in segments and triangles. : D-Z. Du, D-Z. Du, & X-S. Zhang (版), Algorithms and Computation - 5th International Symposium, ISAAC 1994, Proceedings (pp. 505-513). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 834 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-58325-4_217