|
Volumn , Issue , 1993, Pages 73-82
|
Geometric partitioning made easier, even in parallel
|
Author keywords
[No Author keywords available]
|
Indexed keywords
ALGORITHMS;
APPROXIMATION THEORY;
COMPUTATIONAL COMPLEXITY;
DATA STRUCTURES;
RECURSIVE FUNCTIONS;
THREE DIMENSIONAL;
COMPUTATIONAL GEOMETRY;
CONVEX HULL PROBLEM;
EREW PRAM PARALLEL ALGORITHMS;
GEOMETRIC PARTITIONS;
PARAMETRIC SEARCHING PARADIGM;
SCAFFOLD DIMENSION;
SEQUENTIAL ALGORITHM;
VC DIMENSION;
GEOMETRY;
|
EID: 0027846007
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1145/160985.161002 Document Type: Conference Paper |
Times cited : (36)
|
References (45)
|