Efficient uses of the past
- 1 October 1980
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 200-206
- https://doi.org/10.1109/sfcs.1980.18
Abstract
A failing of existing data structures for maintaining balanced trees is their inability to remember the situation they held at previous times. We propose a structure from which it is possible to efficiently reconstruct the state of the data it represented at any time. Applications of this data structure to a number of important problems in geometric computation are also given.Keywords
This publication has 3 references indexed in Scilit:
- On translating a set of rectanglesPublished by Association for Computing Machinery (ACM) ,1980
- Dynamically maintaining configurations in the plane (Detailed Abstract)Published by Association for Computing Machinery (ACM) ,1980
- Transforming static data structures to dynamic structuresPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979