|
||||||
|
||||||
| Undergraduate Honours Projects | ||||||
|
Carleton University - School of Computer Science Undergraduate Honours Project Winter 2010 Finding the Closest Pair in the Query Region Yan Gao 
ABSTRACT This project demonstrates the implementation of a c program to construct a data structure for finding the closest pair points in a query region. To achieve this goal, the algorithm of finding the closest points in plane and the data structure of range tree are used. The project contains two parts, the first to build the data structure of the closest points, and the second to search in the region. Then we test the running time of each part to measure the data structureâÃÂÃÂs performance. |
||||||
|
