How Hard Is Half-Space Range Searching?

J. Pach; B. Chazelle; H. Brönnimann

Discrete & computational geometry (1993)

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

How to cite

top

Pach, J., Chazelle, B., and Brönnimann, H.. "How Hard Is Half-Space Range Searching?." Discrete & computational geometry 10.2 (1993): 143-156. <http://eudml.org/doc/131267>.

@article{Pach1993,
author = {Pach, J., Chazelle, B., Brönnimann, H.},
journal = {Discrete & computational geometry},
keywords = {range searching; lower bounds},
number = {2},
pages = {143-156},
title = {How Hard Is Half-Space Range Searching?},
url = {http://eudml.org/doc/131267},
volume = {10},
year = {1993},
}

TY - JOUR
AU - Pach, J.
AU - Chazelle, B.
AU - Brönnimann, H.
TI - How Hard Is Half-Space Range Searching?
JO - Discrete & computational geometry
PY - 1993
VL - 10
IS - 2
SP - 143
EP - 156
KW - range searching; lower bounds
UR - http://eudml.org/doc/131267
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.