Dynamic maintenance of shortest path trees in simple polygons

Abstract

We present a scheme to dynamically maintain a tooted shortest path tree in a simple polygon. Both insertion and deletion of vertices of the simple polygon are supported. Both operations require O(k log(n/k)) time where k is the number of changes in the shortest path tree. Only simple balanced binary trees are used in the data structure. O(n) space is required.