876 search results - page 139 / 176 » Complexity in geometric SINR |
COMPGEOM
2005
ACM
13 years 12 months ago
2005
ACM
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
DOLAP
2005
ACM
13 years 12 months ago
2005
ACM
Data warehouses and OLAP systems help to interactively analyze huge volume of data. This data, extracted from transactional databases, frequently contains spatial information whic...
DAGSTUHL
2004
13 years 11 months ago
2004
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
APVIS
2001
13 years 11 months ago
2001
Traditional graph drawing is only concerned with viewing of data and relations amount data items. It uses a graph model to present the data items and the relations and tries to ca...
SODA
2004
ACM
13 years 11 months ago
2004
ACM
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...