We present a sublinear algorithm that handles insertion of a new point site to an explicitly
stored graph of the Voronoi diagram. We prove the O (sqrt (n)) bound on the number of …

I will discuss two topics in the area of geometric algorithms: generalized Voronoi diagrams
and graph morphing. The Voronoi diagram is a fundamental geometric structure that …