# Any applications that need fast insert or delete for quadtrees?

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.

• What's your motivation for asking? What research have you done? – D.W. Aug 12 '15 at 4:00
• @D.W. I am planning to develop the quadtree structure which supports fast insertion and deletion, while I do not know whether there are applications which need it. – chain ro Aug 12 '15 at 4:08
• OK. What research have you done? Have you started by investigating whether any of the applications listed in Wikipedia's list of common uses of quadtrees needs fast insertion/deletion? That seems like a basic starting point that you should explore before asking here. We expect you to do a significant amount of research before asking, and to show us in the question what research you've done. See cs.stackexchange.com/help/how-to-ask. – D.W. Aug 12 '15 at 4:12
• Incidentally, I believe the standard algorithm is already fast ($O(\lg n)$ under some reasonable assumptions about "balance"), so there are limits to how much faster it could be. You might already be aware of this. – D.W. Aug 12 '15 at 4:16
• @D.W. Thanks! Sorry that I have not noticed the guide yet. – chain ro Aug 12 '15 at 4:22