Orthogonal queries in segments and triangles

Takeshi Tokuyama

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

1 Citation (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationAlgorithms and Computation - 5th International Symposium, ISAAC 1994, Proceedings
EditorsDing-Zhu Du, Ding-Zhu Du, Xiang-Sun Zhang
PublisherSpringer Verlag
Pages505-513
Number of pages9
ISBN (Print)9783540583257
DOIs
Publication statusPublished - 1994 Jan 1
Event5th Annual International Symposium on Algorithms and Computation, ISAAC 1994 - Beijing, China
Duration: 1994 Aug 251994 Aug 27

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume834 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other5th Annual International Symposium on Algorithms and Computation, ISAAC 1994
CountryChina
CityBeijing
Period94/8/2594/8/27

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Orthogonal queries in segments and triangles'. Together they form a unique fingerprint.

  • Cite this

    Tokuyama, T. (1994). Orthogonal queries in segments and triangles. In D-Z. Du, D-Z. Du, & X-S. Zhang (Eds.), 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); Vol. 834 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-58325-4_217