• DOI:10.1145/22145.22163
Corpus ID: 6090812

A general approach to d-dimensional geometric queries

@inproceedings{Yao1985AGA,
  title={A general approach to d-dimensional geometric queries},
  author={A. Yao and F. Yao},
  booktitle={STOC '85},
  year={1985}
}

A. Yao, F. Yao

Published in STOC '85 1985

Mathematics, Computer Science

It is shown that any bounded region in <italic>E</italic><supscrpt><italic>d</italic></supscrpt> can be divided into 2<supscrpt><italic>d</italic></supscrpt> subregions of equal volume in such a way that no hyperplane in <italic>E</italic><supscrpt><italic>d</italic></supscrpt> can intersect all 2<supscrpt><italic>d</italic></supscrpt> of the subregions. This theorem provides the basis of a data structure scheme for organizing <italic>n</italic> points in <italic>d</italic> dimensions. Under… CONTINUE READING

View on ACM

doi.org

Save to Library

Create Alert

Cite

Launch Research Feed