Sciweavers

11211 search results - page 181 / 2243
» Data Structures
Sort
View
SODA
2004
ACM
155views Algorithms» more  SODA 2004»
15 years 7 months ago
Navigating nets: simple algorithms for proximity search
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...
Robert Krauthgamer, James R. Lee
JUCS
2008
165views more  JUCS 2008»
15 years 6 months ago
Shortcut Fusion of Monadic Programs
: 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...
Cecilia Manzino, Alberto Pardo
IMR
2003
Springer
15 years 11 months ago
Compact Representations of Simplicial Meshes in Two and Three Dimensions
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...
SODA
2008
ACM
105views Algorithms» more  SODA 2008»
15 years 7 months ago
Distribution-sensitive point location in convex subdivisions
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...
Sébastien Collette, Vida Dujmovic, John Iac...
JGTOOLS
2006
80views more  JGTOOLS 2006»
15 years 6 months ago
A Fast Method for Local Penetration Depth Computation
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...
Stephane Redon, Ming C. Lin