The dynamic reverse furthest neighbour algorithm may resolve many
challenges of future applications especially in wireless communication
and geographical information system. The related work is also specified
to distinguish the advancement from the existing methodologies. Examples
with illustration are given in the book to justify the utility of the
dynamic reverse furthest algorithm. The algorithm is also discussed in
the 3-D space. The trade-off between the cost of computing continuous
queries and maintaining result is specified. The experiment is done
based on the data acquired from the trusted organization. The possible
future work is mentioned for enthusiastic researchers. We are grateful
to NASA for providing us such valuable and precious information in a
rapid pace.