Linear Space Data Structures for Two Types of Range Search.

B. Chazelle; Herbert Edelsbrunner

Discrete & computational geometry (1987)

  • Volume: 2, page 113-126
  • ISSN: 0179-5376; 1432-0444/e

How to cite

top

Chazelle, B., and Edelsbrunner, Herbert. "Linear Space Data Structures for Two Types of Range Search.." Discrete & computational geometry 2 (1987): 113-126. <http://eudml.org/doc/131014>.

@article{Chazelle1987,
author = {Chazelle, B., Edelsbrunner, Herbert},
journal = {Discrete & computational geometry},
keywords = {linear space data structures; range searching; homothetic range search problem; domination searching; computational geometry},
pages = {113-126},
title = {Linear Space Data Structures for Two Types of Range Search.},
url = {http://eudml.org/doc/131014},
volume = {2},
year = {1987},
}

TY - JOUR
AU - Chazelle, B.
AU - Edelsbrunner, Herbert
TI - Linear Space Data Structures for Two Types of Range Search.
JO - Discrete & computational geometry
PY - 1987
VL - 2
SP - 113
EP - 126
KW - linear space data structures; range searching; homothetic range search problem; domination searching; computational geometry
UR - http://eudml.org/doc/131014
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.