Group meetup in the presence of obstacles
作者：
Highlights：
• We introduce GNN queries in the obstructed space.
• We develop pruning techniques to efficiently evaluate obstructed GNN queries.
• We propose two efficient techniques to compute aggregate obstructed distances.
• We conduct an extensive experimental analysis to compare our algorithms.
摘要
Highlights•We introduce GNN queries in the obstructed space.•We develop pruning techniques to efficiently evaluate obstructed GNN queries.•We propose two efficient techniques to compute aggregate obstructed distances.•We conduct an extensive experimental analysis to compare our algorithms.
论文关键词：Obstacles,Obstructed distance,Group nearest neighbor queries
论文评审过程：Received 27 October 2015, Accepted 8 April 2016, Available online 4 May 2016, Version of Record 19 May 2016.
论文官网地址：https://doi.org/10.1016/j.is.2016.04.003
