This thesis presents an efficient 0($\sqrt{n}$) on-line algorithm for finding new Voronoi diagram and, using it an 0(n) on-line algorithm for finding new EMST (Euclidean Minimum Spanning Tree), when we are given Voronoi diagram and EMST on n points, and another new point.