Int. Arch. Photogramm. Remote Sens. Spatial Inf. Sci., XLI-B2, 87-93, 2016
http://www.int-arch-photogramm-remote-sens-spatial-inf-sci.net/XLI-B2/87/2016/
doi:10.5194/isprs-archives-XLI-B2-87-2016
 
07 Jun 2016
3D NEAREST NEIGHBOUR SEARCH USING A CLUSTERED HIERARCHICAL TREE STRUCTURE
A. Suhaibah1, U. Uznir1, F. Anton2, D. Mioc2, and A. A. Rahman1 1Geospatial Information Infrastructure (GeoI²) Research Lab., Faculty of Geoinformation and Real Estate, Universiti Teknologi Malaysia, 81310 Skudai, Johor, Malaysia
2Dept. of Geodesy, National Space Institute, Technical University of Denmark, Elektrovej 328, 2800 Kgs. Lyngby, Denmark
Keywords: Nearest Neighbour, 3D Data Clustering, 3D Spatial Database, 3D GIS, Data Management, Information Retrieval Abstract. Locating and analysing the location of new stores or outlets is one of the common issues facing retailers and franchisers. This is due to assure that new opening stores are at their strategic location to attract the highest possible number of customers. Spatial information is used to manage, maintain and analyse these store locations. However, since the business of franchising and chain stores in urban areas runs within high rise multi-level buildings, a three-dimensional (3D) method is prominently required in order to locate and identify the surrounding information such as at which level of the franchise unit will be located or is the franchise unit located is at the best level for visibility purposes. One of the common used analyses used for retrieving the surrounding information is Nearest Neighbour (NN) analysis. It uses a point location and identifies the surrounding neighbours. However, with the immense number of urban datasets, the retrieval and analysis of nearest neighbour information and their efficiency will become more complex and crucial. In this paper, we present a technique to retrieve nearest neighbour information in 3D space using a clustered hierarchical tree structure. Based on our findings, the proposed approach substantially showed an improvement of response time analysis compared to existing approaches of spatial access methods in databases. The query performance was tested using a dataset consisting of 500,000 point locations building and franchising unit. The results are presented in this paper. Another advantage of this structure is that it also offers a minimal overlap and coverage among nodes which can reduce repetitive data entry.
Conference paper (PDF, 2838 KB)


Citation: Suhaibah, A., Uznir, U., Anton, F., Mioc, D., and Rahman, A. A.: 3D NEAREST NEIGHBOUR SEARCH USING A CLUSTERED HIERARCHICAL TREE STRUCTURE, Int. Arch. Photogramm. Remote Sens. Spatial Inf. Sci., XLI-B2, 87-93, doi:10.5194/isprs-archives-XLI-B2-87-2016, 2016.

BibTeX EndNote Reference Manager XML