Name
Abstract | ||
|---|---|---|
Suppose we are given n moving postmen described by their motion equations p i (t) = s i + v i t; i = 1, ..., n, where s i 2 IR 2 is the position of the i'th postman at time t = 0, and v i 2 IR 2 is his velocity. The problem we address is how to preprocess the postmen data so as to be able to efficiently answer two types of nearest neighbor queries. The first one asks "who is the nearest postman at time t q to a dog located at point s q ?". In the second type a query dog is located a point s q... |
Year | Venue | Keywords |
|---|---|---|
1994 | CCCG | computational geometry,voronoi diagram |
Field | DocType | Citations |
k-nearest neighbors algorithm,Data structure,Discrete mathematics,Combinatorics,Parametric search,Computational geometry,Preprocessor,Voronoi diagram,Equations of motion,Mathematics | Conference | 7 |
PageRank | References | Authors |
1.53 | 10 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Olivier Devillers | 1 | 184 | 23.75 |
| Mordecai J. Golin | 2 | 767 | 89.67 |
| Klara Kedem | 3 | 1291 | 251.41 |
| Stefan Schirra | 4 | 509 | 70.29 |