How to search in history
From MaRDI portal
Publication:3694706
DOI10.1016/S0019-9958(85)80045-0zbMath0575.68062MaRDI QIDQ3694706
Publication date: 1985
Published in: Information and Control (Search for Journal in Brave)
computational geometrydynamic data structurethree-dimensional geometryhistory of updatesfast neighbour computationquery response time
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Data structures (68P05) Information storage and retrieval of data (68P20)
Related Items
Fractional cascading. II: Applications, Optimal cooperative search in fractional cascaded data structures, Making data structures persistent, Computing Euclidean maximum spanning trees, Euclidean minimum spanning trees and bichromatic closest pairs, Farthest neighbors, maximum spanning trees and related problems in higher dimensions, On ray shooting in convex polytopes, The complexity of many cells in arrangements of planes and related problems, An acyclicity theorem for cell complexes in d dimensions, On constructing the relative neighborhood graphs in Euclidean k- dimensional spaces, New applications of random sampling in computational geometry
