1
vote
Memory efficient undo data structure
Yes. A relevant technical term is 'persistent data structure'. (See also persistent-data-structure.) There are many techniques for building persistent versions of standard data structures (trees, ...
D.W.♦
- 154k
1
vote
How to maintain completely dynamic convex hull quickly?
You can use my code. I implemented the ideas from the paper by Overmars and van Leeuwen.
https://github.com/sumeetshirgure/DynamicPlanarHull/tree/master
Only top scored, non community-wiki answers of a minimum length are eligible