CGAL users discussion list

[Häberling Armin <>]

Hi,

I'd like to compute the reverse nearest neighbour for a delaunay 
triangulation.
I.e. for a given query point q I want to find all vertices in the 
triangulation that have q as their nearest neighbour.

I found on the web a lot about alogritms for nearest neighbour queries, but 
nothing about the reverse nearest neighbour. Has anyone done something like 
this before or does know a fast algorithm for this.

Thanks in advance

Armin