Geolocation Search with SharePoint Fast Search Feature and A (star) Search Algorithm

1Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper represents a review on geolocation finding mechanism through SharePoint fast search and A* search algorithm. As a part of the SharePoint Fast search authors will compare two algorithms; Euclidean distance and Taxicab geometry distance in order to find a geolocation based on the shortest path. Throughout the paper, authors have highlighted the use of each individual algorithm (Euclidean distance, Taxicab geometry distance, and A* search algorithm) in terms finding the shortest path.

Cite

CITATION STYLE

APA

Hettipathirana, H. C. D., & Ariyapala, T. V. (2019). Geolocation Search with SharePoint Fast Search Feature and A (star) Search Algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11591 LNCS, pp. 287–295). Springer Verlag. https://doi.org/10.1007/978-3-030-21817-1_22

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free