DocumentCode
2175814
Title
Efficient uses of the past
Author
Dobkin, David P. ; Munro, J.Ian
fYear
1980
fDate
13-15 Oct. 1980
Firstpage
200
Lastpage
206
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
Computer science; Councils; Data structures; Graphics; History; Object detection; Statistics; Tree data structures; Tree graphs;
fLanguage
English
Publisher
ieee
Conference_Titel
Foundations of Computer Science, 1980., 21st Annual Symposium on
Conference_Location
Syracuse, NY, USA
ISSN
0272-5428
Type
conf
DOI
10.1109/SFCS.1980.18
Filename
4567820
Link To Document