Range Searching with Efficient Hierarchical Cuttings.

J. Matousek

Discrete & computational geometry (1993)

  • Volume: 10, Issue: 2, page 157-182
  • ISSN: 0179-5376; 1432-0444/e

How to cite

top

Matousek, J.. "Range Searching with Efficient Hierarchical Cuttings.." Discrete & computational geometry 10.2 (1993): 157-182. <http://eudml.org/doc/131268>.

@article{Matousek1993,
author = {Matousek, J.},
journal = {Discrete & computational geometry},
keywords = {simplex range searching problem; linear-space; data structures},
number = {2},
pages = {157-182},
title = {Range Searching with Efficient Hierarchical Cuttings.},
url = {http://eudml.org/doc/131268},
volume = {10},
year = {1993},
}

TY - JOUR
AU - Matousek, J.
TI - Range Searching with Efficient Hierarchical Cuttings.
JO - Discrete & computational geometry
PY - 1993
VL - 10
IS - 2
SP - 157
EP - 182
KW - simplex range searching problem; linear-space; data structures
UR - http://eudml.org/doc/131268
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.