Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs

Pankaj K. Agarwal, Herbert Edelsbrunner, Otfried Schwarzkopf, Emo Welzl. Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs. In Symposium on Computational Geometry. pages 203-210, 1990. [doi]

@inproceedings{AgarwalESW90,
  title = {Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs},
  author = {Pankaj K. Agarwal and Herbert Edelsbrunner and Otfried Schwarzkopf and Emo Welzl},
  year = {1990},
  doi = {10.1145/98524.98567},
  url = {http://doi.acm.org/10.1145/98524.98567},
  researchr = {https://researchr.org/publication/AgarwalESW90},
  cites = {0},
  citedby = {0},
  pages = {203-210},
  booktitle = {Symposium on Computational Geometry},
}