Rankings
Publications
Search Publications
Cited-By Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Login
Register
Home
Publications
Euclidean minimum spanning trees and bichromatic closest pairs
Home
Publications
Euclidean minimum spanning trees and bichromatic closest pairs
Euclidean minimum spanning trees and bichromatic closest pairs
PA
Pankaj K. Agarwal
Pankaj K. Agarwal
HE
Herbert Edelsbrunner
Herbert Edelsbrunner
OS
Otfried Schwarzkopf
Otfried Schwarzkopf
EW
Emo Welzl
Emo Welzl
Publisher Website
Google Scholar
Add to Library
Cite
Download
Share
Download
1 January 1990
conference paper
Published by
Association for Computing Machinery (ACM)
https://doi.org/10.1145/98524.98567
Abstract
No abstract available
Keywords
RANDOMIZED ALGORITHM
EUCLIDEAN MINIMUM SPANNING TREE
Cited by 10 articles