Journal ArticleOPEN ACCESS

RECTANGULAR POINT LOCATION IN D DIMENSIONS WITH APPLICATIONS.

Computer Journal (1986) 29(1) 76-82
DOI: 10.1093/comjnl/29.1.76
16Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Rectangle location search in d dimensions is finding the d-dimensional axis-parallel box of a non-overlapping collection C that contains a query point. A new data structure is proposed that requires optimal space and O(log**d vertical C vertical ) time for a search. The significance of this data structure in practical applications is substantiated by empirical examinations of its behaviour.

Cite

CITATION STYLE

APA

Edelsbrunner, H., Haring, G., & Hilbert, D. (1986). RECTANGULAR POINT LOCATION IN D DIMENSIONS WITH APPLICATIONS. Computer Journal, 29(1), 76–82. https://doi.org/10.1093/comjnl/29.1.76

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