The publication of Chiang and Tamassia's paper on dynamic algorithms in computational geometry included several algorithms used in solving dynamic computational geometry problems such as:
- Dynamic Range Searching
- Dynamic Point Enclosure
- Dynamic Set Intersection
What are some open problems in dynamic computational geometry currently that have good static algorithms but worse dynamic algorithms? I am especially interested in algorithms that use priority queues in the static solution.