ScienceGate
Advanced Search
Author Search
Journal Finder
Blog
Sign in / Sign up
ScienceGate
Search
Author Search
Journal Finder
Blog
Sign in / Sign up
Constructing Euclidean minimum spanning trees and all nearest neighbors on reconfigurable meshes
IEEE Transactions on Parallel and Distributed Systems
◽
10.1109/71.532112
◽
1996
◽
Vol 7
(8)
◽
pp. 806-817
◽
Cited By ~ 12
Author(s):
T.H. Lai
◽
Ming-Jye Sheng
Keyword(s):
Spanning Trees
◽
Nearest Neighbors
◽
Minimum Spanning Trees
◽
Reconfigurable Meshes
◽
Euclidean Minimum Spanning Trees
Download Full-text
Related Documents
Cited By
References
Dynamic Euclidean minimum spanning trees and extrema of binary functions
Discrete & Computational Geometry
◽
10.1007/bf02574030
◽
1995
◽
Vol 13
(1)
◽
pp. 111-122
◽
Cited By ~ 41
Author(s):
D. Eppstein
Keyword(s):
Spanning Trees
◽
Minimum Spanning Trees
◽
Euclidean Minimum Spanning Trees
◽
Binary Functions
Download Full-text
The realization problem for Euclidean minimum spanning trees is NP-hard
Proceedings of the tenth annual symposium on Computational geometry - SCG '94
◽
10.1145/177424.177507
◽
1994
◽
Cited By ~ 14
Author(s):
Peter Eades
◽
Sue Whitesides
Keyword(s):
Spanning Trees
◽
Minimum Spanning Trees
◽
Np Hard
◽
Realization Problem
◽
Euclidean Minimum Spanning Trees
Download Full-text
Euclidean minimum spanning trees and bichromatic closest pairs
Discrete & Computational Geometry
◽
10.1007/bf02574698
◽
1991
◽
Vol 6
(3)
◽
pp. 407-422
◽
Cited By ~ 77
Author(s):
Pankaj K. Agarwal
◽
Herbert Edelsbrunner
◽
Otfried Schwarzkopf
◽
Emo Welzl
Keyword(s):
Spanning Trees
◽
Minimum Spanning Trees
◽
Euclidean Minimum Spanning Trees
Download Full-text
The realization problem for Euclidean minimum spanning trees is NP-hard
Algorithmica
◽
10.1007/bf02086608
◽
1996
◽
Vol 16
(1)
◽
pp. 60-82
◽
Cited By ~ 29
Author(s):
P. Eades
◽
S. Whitesides
Keyword(s):
Spanning Trees
◽
Minimum Spanning Trees
◽
Np Hard
◽
Realization Problem
◽
Euclidean Minimum Spanning Trees
Download Full-text
Density-equalizing Euclidean minimum spanning trees for the detection of all disease cluster shapes
Proceedings of the National Academy of Sciences
◽
10.1073/pnas.0609457104
◽
2007
◽
Vol 104
(22)
◽
pp. 9404-9409
◽
Cited By ~ 20
Author(s):
S. C. Wieland
◽
J. S. Brownstein
◽
B. Berger
◽
K. D. Mandl
Keyword(s):
Spanning Trees
◽
Minimum Spanning Trees
◽
Disease Cluster
◽
Euclidean Minimum Spanning Trees
Download Full-text
Testing Euclidean minimum spanning trees in the plane
ACM Transactions on Algorithms
◽
10.1145/1367064.1367071
◽
2008
◽
Vol 4
(3)
◽
pp. 1-23
◽
Cited By ~ 2
Author(s):
Artur Czumaj
◽
Christian Sohler
Keyword(s):
Spanning Trees
◽
Minimum Spanning Trees
◽
Euclidean Minimum Spanning Trees
Download Full-text
Euclidean minimum spanning trees and bichromatic closest pairs
Proceedings of the sixth annual symposium on Computational geometry - SCG '90
◽
10.1145/98524.98567
◽
1990
◽
Cited By ~ 8
Author(s):
Pankaj K. Agarwal
◽
Herbert Edelsbrunner
◽
Otfried Schwarzkopf
◽
Emo Welzl
Keyword(s):
Spanning Trees
◽
Minimum Spanning Trees
◽
Euclidean Minimum Spanning Trees
Download Full-text
Euclidean minimum spanning trees with independent and dependent geometric uncertainties
Computational Geometry
◽
10.1016/j.comgeo.2020.101744
◽
2021
◽
pp. 101744
Author(s):
Rivka Gitik
◽
Or Bartal
◽
Leo Joskowicz
Keyword(s):
Spanning Trees
◽
Minimum Spanning Trees
◽
Geometric Uncertainties
◽
Euclidean Minimum Spanning Trees
Download Full-text
On the area requirements of Euclidean minimum spanning trees
Computational Geometry
◽
10.1016/j.comgeo.2012.10.011
◽
2014
◽
Vol 47
(2)
◽
pp. 200-213
◽
Cited By ~ 1
Author(s):
Patrizio Angelini
◽
Till Bruckdorfer
◽
Marco Chiesa
◽
Fabrizio Frati
◽
Michael Kaufmann
◽
...
Keyword(s):
Spanning Trees
◽
Minimum Spanning Trees
◽
Euclidean Minimum Spanning Trees
Download Full-text
Better ϵ-Dependencies for Offline Approximate Nearest Neighbor Search, Euclidean Minimum Spanning Trees, and ϵ-Kernels
Annual Symposium on Computational Geometry - SOCG'14
◽
10.1145/2582112.2582161
◽
2014
◽
Cited By ~ 6
Author(s):
Sunil Arya
◽
Timothy M. Chan
Keyword(s):
Spanning Trees
◽
Nearest Neighbor
◽
Nearest Neighbor Search
◽
Minimum Spanning Trees
◽
Approximate Nearest Neighbor Search
◽
Approximate Nearest Neighbor
◽
Neighbor Search
◽
Euclidean Minimum Spanning Trees
Download Full-text
Sign in / Sign up
Close
Export Citation Format
Close
Share Document
Close