Abstract
We study the amortized number of combinatorial changes (edge insertions and removals) needed to update the graph structure of the Voronoi diagram (and......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
