A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
On-line Steiner trees in the Euclidean plane

1992
*
Proceedings of the eighth annual symposium on Computational geometry - SCG '92
*

Suppose we are given a sequence of n points in the Euclidean plane, and our objective is to construct, on-line, a connected graph that connects all of them, trying to minimize the total sum of lengths of its edges. The points appear one at a time, and at each step the on-line algorithm must construct a connected graph that contains all current points by connecting the new point to the previously constructed graph. This can be done by joining the new point (not necessarily by a straight line) to

doi:10.1145/142675.142744
dblp:conf/compgeom/AlonA92
fatcat:ml42mh2tundhffscqmttvspkoi