Orthogonal queries in segments and triangles

Takeshi Tokuyama

doi:10.1007/3-540-58325-4_217

Orthogonal queries in segments and triangles

Takeshi Tokuyama

INF - System Information Sciences

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English
Title of host publication	Algorithms and Computation - 5th International Symposium, ISAAC 1994, Proceedings
Editors	Ding-Zhu Du, Ding-Zhu Du, Xiang-Sun Zhang
Publisher	Springer Verlag
Pages	505-513
Number of pages	9
ISBN (Print)	9783540583257
DOIs	https://doi.org/10.1007/3-540-58325-4_217
Publication status	Published - 1994 Jan 1
Event	5th Annual International Symposium on Algorithms and Computation, ISAAC 1994 - Beijing, China Duration: 1994 Aug 25 → 1994 Aug 27

Publication series

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

Other

Other	5th Annual International Symposium on Algorithms and Computation, ISAAC 1994
Country/Territory	China
City	Beijing
Period	94/8/25 → 94/8/27

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/3-540-58325-4_217

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

Orthogonal queries in segments and triangles. / Tokuyama, Takeshi.

Algorithms and Computation - 5th International Symposium, ISAAC 1994, Proceedings. ed. / Ding-Zhu Du; Ding-Zhu Du; Xiang-Sun Zhang . Springer Verlag, 1994. p. 505-513 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 834 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 834 LNCS, Springer Verlag, pp. 505-513, 5th Annual International Symposium on Algorithms and Computation, ISAAC 1994, Beijing, China, 94/8/25. https://doi.org/10.1007/3-540-58325-4_217

Tokuyama T. Orthogonal queries in segments and triangles. In Du D-Z, Du D-Z, Zhang X-S, editors, Algorithms and Computation - 5th International Symposium, ISAAC 1994, Proceedings. Springer Verlag. 1994. p. 505-513. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-58325-4_217

Tokuyama, Takeshi. / Orthogonal queries in segments and triangles. Algorithms and Computation - 5th International Symposium, ISAAC 1994, Proceedings. editor / Ding-Zhu Du ; Ding-Zhu Du ; Xiang-Sun Zhang . Springer Verlag, 1994. pp. 505-513 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{af57d369baf5402bab5873abf143ec9c,

title = "Orthogonal queries in segments and triangles",

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.",

author = "Takeshi Tokuyama",

year = "1994",

month = jan,

day = "1",

doi = "10.1007/3-540-58325-4_217",

language = "English",

isbn = "9783540583257",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "505--513",

editor = "Ding-Zhu Du and Ding-Zhu Du and {Zhang }, Xiang-Sun",

booktitle = "Algorithms and Computation - 5th International Symposium, ISAAC 1994, Proceedings",

note = "5th Annual International Symposium on Algorithms and Computation, ISAAC 1994 ; Conference date: 25-08-1994 Through 27-08-1994",

}

TY - GEN

T1 - Orthogonal queries in segments and triangles

AU - Tokuyama, Takeshi

PY - 1994/1/1

Y1 - 1994/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85027494760&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85027494760&partnerID=8YFLogxK

U2 - 10.1007/3-540-58325-4_217

DO - 10.1007/3-540-58325-4_217

M3 - Conference contribution

AN - SCOPUS:85027494760

SN - 9783540583257

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 505

EP - 513

BT - Algorithms and Computation - 5th International Symposium, ISAAC 1994, Proceedings

A2 - Du, Ding-Zhu

A2 - Zhang , Xiang-Sun

PB - Springer Verlag

T2 - 5th Annual International Symposium on Algorithms and Computation, ISAAC 1994

Y2 - 25 August 1994 through 27 August 1994

ER -

Orthogonal queries in segments and triangles

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this