|
Volumn , Issue , 1992, Pages 320-329
|
Finding k farthest pairs and k closest/farthest bichromatic pairs of points in the plane
a a |
Author keywords
[No Author keywords available]
|
Indexed keywords
COMPUTATIONAL COMPLEXITY;
GEOMETRY;
BICHROMATIC PAIRS;
COMPUTATIONAL GEOMETRY;
COMPUTATIONAL METHODS;
|
EID: 0026970957
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
Times cited : (14)
|
References (20)
|