I've already asked a similar question in mathematics exchange without getting an answer, I read a bit more and I think the question might be more suitable for the signal processing exchange.
Basically I was reviewing my background in edge detection methods and I've found the following statement:
For many applications, however, we wish to think such a continuous gradient image to only return isolated edges, i.e., as single pixels at discrete locations along the edge contours. This can be achieved by looking for maxima in the edge strength (gradient magnitude) in a direction perpendicular to the edge orientation, i.e., along the gradient direction. Finding this maximum corresponds to taking a directional derivative of the strength field in the direction of the gradient and then looking for zero crossing. The desired directional derivative is equivalent to the dot product between a second gradient operator and the result of the first... The gradient dot product with the gradient is called the Laplacian.
I did the calculations but I'm not getting the laplacian, however I've accidentally found this paper, where basically the explanation seems essentially to be "directional derivative and laplacian are different but not that much, so given that taking the laplacian instead of the second directional derivative is less expensive (computationally speaking) we can use the laplacian"
My question is then... is this what Szelisky mean?