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 SearchingDynamic Point EnclosureDynamic Set IntersectionAnd others.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.
Problems in dynamic algorithms in computational geometry
cc.complexity theory;ds.algorithms;cg.comp geom