hypotenuse

I got the below code from @DanS at this link how-to-display-a-map-still-image-file-with-a-moving-current-location onCurrentPosition(Location current){ double hypotenuse = upperLeft.distanceTo(current); double bearing = upperLeft.bearingTo(current); double currentDistanceX = Math.cos(bearing) * hypotenuse; // "percentage to mark the position" double currentPixelX = (currentDistanceX / upperLeft.distanceTo(lowerRight) * Math.cos(upperLeft.bearingTo(lowerRight))) * mapWidth; moveIndicatorX(currentPixelX); } Here are the values: current: 41.850033,-87.65005229999997 upperLeft: 41.866514127810355,

I did some testing with C++ hypot() and Java Math.hypot . They both seem to be significantly slower than sqrt(a*a + b*b) . Is that because of a better precision? What method to calculate a hypotenuse hypot function uses? Surprisingly I couldn't find any indication of poor performance in the documentation. It's not a simple sqrt function. You should check this link for the implementation of the algorithm: http://www.koders.com/c/fid7D3C8841ADC384A5F8DE0D081C88331E3909BF3A.aspx It has while loop to check for convergence /* Slower but safer algorithm due to Moler and Morrison. Never produces any