2638 search results - page 328 / 528 » Random Geometric Complexes |
164
click to vote
DOLAP
2005
ACM
15 years 8 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...
175
click to vote
DAGSTUHL
2004
15 years 8 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...
163
click to vote
APVIS
2001
15 years 8 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...
165
click to vote
SODA
2004
ACM
15 years 7 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...
173
click to vote
VMV
2004
15 years 7 months ago
2004
Efficiently rendering highly structured models distant from the viewer constitutes a difficult task since the geometric complexity has to be reduced extremely while simultaneously...