Reactive proximity data structures for graphs.
D. Eppstein,
M. T. Goodrich, and
N. Mamano.
arXiv:1803.04555.
Proc. 13th Latin American Theoretical Informatics Symposium (LATIN
2018), Buenos Aires, Argentina.
Springer, Lecture Notes in
Comp. Sci. 10807 (2018), pp. 777–789.
We develop data structures for solving nearest neighbor queries for dynamic subsets of vertices in a planar graph, or more generally for a graph in any graph class with small separators (polynomial expansion).