Skip to main content
Conference Proceedings

Orthogonal queries in segments and triangles

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1994) 834 LNCS 505-513
DOI: 10.1007/3-540-58325-4_217
1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Tokuyama, T. (1994). Orthogonal queries in segments and triangles. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 834 LNCS, pp. 505–513). Springer Verlag. https://doi.org/10.1007/3-540-58325-4_217

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free