3 citations · 4 across the 2 of their papers we have counts for
1 paper · 1 filter
Haitao Wang, Yiming Zhao
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 stru…