52 search results - page 4 / 11 » Testing Euclidean minimum spanning trees in the plane |
CATS
2007
15 years 1 months ago
2007
Given a set S of n points in the plane, a minimumdilation spanning tree of S is a tree with vertex set S of smallest possible dilation. We show that given a set S of n points and ...
111
click to vote
JACM
2010
14 years 10 months ago
2010
We present a fully dynamic randomized data structure that can answer queries about the convex hull of a set of n points in three dimensions, where insertions take O(log3 n) expect...
124
click to vote
CCCG
2003
15 years 1 months ago
2003
We consider the problem of designing a transportation network to allow the residents of the network to avail service provided by a single facility whose location is predetermined....
108
click to vote
SODA
2008
ACM
15 years 1 months ago
2008
ACM
New tight bounds are presented on the minimum length of planar straight line graphs connecting n given points in the plane and having convex faces. Specifically, we show that the ...
112
click to vote
SAC
2003
ACM
15 years 4 months ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...