Group Visible Nearest Surrounder Query in Obstacle Space

Obstructed nearest neighbor query is a kind of nearest neighbor query for the existence of obstacles, which has important application value in the field of geographic information system, spatial analysis for existing obstacles and so on. In this paper, we focus on the problem of group visible nearest surrounder query in obstacle space. We formalize the related definitions, and propose a hybrid index structure which represents and stores the data objects and obstacles with the same description method. We also propose an algorithm that deals with the group visible nearest surrounder query based on the hybrid index structure. We analyze the cost of the proposed algorithm experimentally by using both real and synthetic datasets, and the experimental results show that the algorithm presented can deal with the group visible nearest surrounder query effectively.