I am stuck on that question, it's about Voronoi diagrams
Show that for some set of $n$ points, there can be $\Omega(n^2)$ intersections between the edges of the Voronoi diagram and the edges of the farthest site Voronoi diagram.
In this question, I think the intersections is the vertexes of the farthest site. Am I correct? And I need to prove there is at least $\Omega(n^2)$ intersections like that?
Could you please give me some hint about it?