| Document Date: 2005-12-09 06:20:39
Open Document File Size: 1,21 MBShare Result on Facebook
/ Facility University of Glamorgan / / IndustryTerm spatial search / proximal search procedures / linear quadtree search procedure / search_queue item records / quadtree search / search process / triangulation-based algorithm / geographical applications / neighbourhood search / search distance / locational search procedures / search proceeds / irregular networks / search technique / nearest-neighbour search radius / search procedure / search_queue / proximity search / then processing time / search_radius / queue search_queue / quadtree search procedure / exhaustive search / neighbour search / search algorithm / nearest-neighbour algorithm / point site / triangulation proximity search algorithm / geographical information systems / search methods / search radius / search time complexity / / Organization University of Glamorgan / Christopher D. Eynon School of Computing / / Person Lee / Christopher B. Jones / Lin / J. Mark Ware / / Position head of search_queue / triangulated model the entire region / head of priority / head / / PublishedMedium The CPU times / / Technology triangulation-based algorithm / 4 The SDS algorithm / search algorithm / SDS algorithm / 4.2 Analysis The algorithm / nearest-neighbour algorithm / triangulation proximity search algorithm / /
SocialTag |
1 Introduction Triangulated spatial models and neighbourhood search: an experimental comparison