Bresenham algorithm in Javascript

后端 未结 2 1438
清酒与你
清酒与你 2020-11-27 03:41

I need a fast algorithm for calculating coordinates for a line between two points. I tried to find good JavaScript Bresenham implementation, but there are too many and quite

相关标签:
2条回答
  • 2020-11-27 04:21

    Rewriting your supplied pseudo-code into JavaScript:

    function line(x0, y0, x1, y1) {
       var dx = Math.abs(x1 - x0);
       var dy = Math.abs(y1 - y0);
       var sx = (x0 < x1) ? 1 : -1;
       var sy = (y0 < y1) ? 1 : -1;
       var err = dx - dy;
    
       while(true) {
          setPixel(x0, y0); // Do what you need to for this
    
          if ((x0 === x1) && (y0 === y1)) break;
          var e2 = 2*err;
          if (e2 > -dy) { err -= dy; x0  += sx; }
          if (e2 < dx) { err += dx; y0  += sy; }
       }
    }
    

    Note that comparing floats directly may fail as you step (though it shouldn't when stepping by integer amounts, it might if either end point is non-integer), so instead of directly comparing the end points you might want to use an epsilon:

    if (Math.abs(x0 - x1) < 0.0001 && Math.abs(y0 - y1) < 0.0001) break;
    

    This will necessarily slow you down, however, so only do this if you are dealing with non-integers.

    0 讨论(0)
  • 2020-11-27 04:30

    Disclaimer: I extracted this answer from the OPs question. Answers should not be contained in the question itself.


    Answer provided by Boris Hamanov:

    Thanks everybody! This is what I came with at the end:

    function calcStraightLine (startCoordinates, endCoordinates) {
        var coordinatesArray = new Array();
        // Translate coordinates
        var x1 = startCoordinates.left;
        var y1 = startCoordinates.top;
        var x2 = endCoordinates.left;
        var y2 = endCoordinates.top;
        // Define differences and error check
        var dx = Math.abs(x2 - x1);
        var dy = Math.abs(y2 - y1);
        var sx = (x1 < x2) ? 1 : -1;
        var sy = (y1 < y2) ? 1 : -1;
        var err = dx - dy;
        // Set first coordinates
        coordinatesArray.push(new Coordinates(y1, x1));
        // Main loop
        while (!((x1 == x2) && (y1 == y2))) {
            var e2 = err << 1;
            if (e2 > -dy) {
                err -= dy;
                x1 += sx;
            }
            if (e2 < dx) {
                err += dx;
                y1 += sy;
            }
            // Set coordinates
            coordinatesArray.push(new Coordinates(y1, x1));
        }
        // Return the result
        return coordinatesArray;
    }
    
    0 讨论(0)
提交回复
热议问题