dc:subject
|
Euclidean minimum spanning tree, geometric optimization, minimum spanning trees, dynamic data structures, half-space range reporting, minima, decomposable function, geometric problems, closest/farthest neighbor searching, fixed dimension linear programming, bi-chromatic closest pair, diameter
(xsd:string)
|