Abstract: The present disclosure relates to a method for searching for the shortest path having a minimum link between buildings in a rectilinear polygon obstacle environment, which has been implemented to calculate the shortest path having a minimum link, among the shortest paths based on a Manhattan distance from one building to another building, when buildings are given in a rectilinear polygon obstacle environment. According to the present disclosure, in searching for the shortest path having a minimum link between two buildings, a more efficient data structure can be used in terms of an execution time and memory. A building-building minimum link and shortest path search problem can be solved through only the addition of very small operations by using the segment-point minimum link and shortest path search algorithm which can be easily expanded to the building-building minimum link and shortest path search problem.

Abstract: The present disclosure relates to a GIS geographical information retrieval method using a dynamic k-nearest neighbor search algorithm in an obstacle environment, which has been devised to search for geographical information by using a dynamic k-nearest neighbor search algorithm in an obstacle environment. The GIS geographical information retrieval method using a dynamic k-nearest neighbor search algorithm in an obstacle environment has an effect in that it can optimize a search time by considering obstacles as a range of angles, not discrete objects, on the basis of a query point, using the shortest path characteristics at the same time, and assigning priority to neighbors based on the calculated range of angles.