  Given a set $P$ of $n$ points that are moving in the plane, we consider the
problem of computing a spanning tree for these moving points that does not
change its combinatorial structure during the point movement. The objective is
to minimize the bottleneck weight of the spanning tree (i.e., the largest
Euclidean length of all edges) during the whole movement. The problem was
solved in $O(n^2)$ time previously [Akitaya, Biniaz, Bose, De Carufel,
Maheshwari, Silveira, and Smid, WADS 2021]. In this paper, we present a new
algorithm of $O(n^{4/3} \log^3 n)$ time.
