Range searching in low-density environments

We define a set of arbitrarily-shaped objects in R(d) to be a low-density environment if any axis-parallel hypercube intersects only few objects of comparable or larger size. Generalizing and simplifying previous results for fat objects, we present a data structure for point location in a low-density environment, and we show how this data structure can be extended to perform range search queries with query ranges of size comparable to the smallest object.
Publisher
ELSEVIER SCIENCE BV
Issue Date
1996-11
Language
ENG
Keywords

FAT

Citation

INFORMATION PROCESSING LETTERS, v.60, no.3, pp.121 - 127

ISSN
0020-0190
DOI
10.1016/S0020-0190(96)00154-8
URI
http://hdl.handle.net/10203/326
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
1996-26.pdf(199.56 kB)Download
  • Hit : 398
  • Download : 202
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button
⊙ Cited 13 items in WoSClick to see citing articles inrecords_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0