d Abstract] Robert Krauthgamer James R. Lee We present a simple deterministic data structure for maintaining a set S of points in a general metric space, while supporting proximit...
: Functional programs often combine separate parts of the program using intermediate data structures for communicating results. Programs so defined are easier to understand and mai...
We describe data structures for representing simplicial meshes compactly while supporting online queries and updates efficiently. Our data structure requires about a factor of fi...
Daniel K. Blandford, Guy E. Blelloch, David E. Car...
A data structure is presented for point location in convex planar subdivisions when the distribution of queries is known in advance. The data structure has an expected query time t...
In this appendix, we provide some details on the data structures used to cluster the intersection segments. Although the data structures are fairly classical (a heap, a grid and a...