Using Euler's relation one can prove that there exist at most 3n-6 edges in a triangulation of n points. Hence, the space requirement of both algorithms is 
because we only used a one dimensional array of edges and a one dimensional array of points.