We develop two approaches for performing accurate traveltime in a 2D lattice. These methods are extensions of the Fast Marching method and consist in considering the 8-connected neighbors to compute the solution of the Eikonal equation. The interest of our approach is demonstrated by comparing the results obtained with the classical Fast Marching algorithm and with our methods in the case of a simple approximation of the Euclidian distance.