Algorithms and Data Structures: Workshop WADS '89, Ottawa, Canada, August 17-19,
67,24 €
Efficient spatial point location. - Analysis of kdt-trees: Kd-trees improved by local reorganisations. - Optimal algorithms for List Indexing and Subset Rank. - The Delaunay triangulation closely approximates the complete Euclidean graph.
Jetzt bei Ebay:
