I know that quadtree could be used in collision detection. But most articles I found are related with quadtree construction and retrieval. I wonder if there are some circumstances which involve both a great number of insert and remove operations? If any, please list out the papers.
I am planning to develop the quadtree structure which supports fast insertion and deletion. I am wondering whether there are applications that need this feature.