![]() |
Volumn , Issue , 1988, Pages 23-33
|
Partition trees for triangle counting and other range searching problems
|
Author keywords
[No Author keywords available]
|
Indexed keywords
DATA STRUCTURES;
FORESTRY;
COMBINATORIAL BOUNDS;
PREPROCESSING TIME;
QUERY TIME;
RANGE SEARCHING;
SPACE DATA STRUCTURES;
VAPNIK-CHERVONENKIS DIMENSIONS;
COMPUTATIONAL GEOMETRY;
|
EID: 0006621862
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1145/73393.73397 Document Type: Conference Paper |
Times cited : (79)
|
References (14)
|