Search filters

Euclidean minimum spanning trees and bichromatic closest pairs

Image Image of a generic work. The text above it indicates that there is no free image of the work available, and that if you own one, you can click on the placeholder link to upload it.
Description journal article from 'Discrete & Computational Geometry' published in 1991
Author/s

author: Herbert Edelsbrunner  Pankaj K. Agarwal  Emo Welzl 

Publication date September 1, 1991
Language English
Country of origin
Wikipedia link
Access work

https://link.springer.com/article/10.1007/BF02574698
Copyright status
Missing/wrong data? Edit Wikidata item

Paulina is supported by:

About Paulina

Help