Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.

H. Edelsbrunner; E. Welzl; P.K. Agarwal; O. Schwarzkopf

Discrete & computational geometry (1991)

  • Volume: 6, Issue: 5, page 407-422
  • ISSN: 0179-5376; 1432-0444/e

How to cite

top

Edelsbrunner, H., et al. "Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.." Discrete & computational geometry 6.5 (1991): 407-422. <http://eudml.org/doc/131167>.

@article{Edelsbrunner1991,
author = {Edelsbrunner, H., Welzl, E., Agarwal, P.K., Schwarzkopf, O.},
journal = {Discrete & computational geometry},
keywords = {minimum spanning trees; bichromatic closest pair},
number = {5},
pages = {407-422},
title = {Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.},
url = {http://eudml.org/doc/131167},
volume = {6},
year = {1991},
}

TY - JOUR
AU - Edelsbrunner, H.
AU - Welzl, E.
AU - Agarwal, P.K.
AU - Schwarzkopf, O.
TI - Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.
JO - Discrete & computational geometry
PY - 1991
VL - 6
IS - 5
SP - 407
EP - 422
KW - minimum spanning trees; bichromatic closest pair
UR - http://eudml.org/doc/131167
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.