Skip to main content

performance tuning - How to implement Bresenham’s algorithm as a system of equations?


Bresenham's line drawing algorithm is usually implemented via loops. But in Mathematica we can take advantage of its ability to solve Diophantine equations. From educational viewpoint it is quite interesting to write Bresenham in a form suitable for Solve or other superfunction. Such implementation also potentially can be very terse and sufficiently efficient for most practical applications.


I have implemented Bresenham for the first octant and obtained general solution via reflections (code for version 10):


Clear[bresenhamSolve];
bresenhamSolve[p1_, p2_] /;
GreaterEqual @@ Abs[p2 - p1] && MatchQ[Sign[p2 - p1], {1, 1} | {1, 0}] :=
Block[{ab = First@Solve[{p1, p2}.{a, 1} == b], x, y}, {x, y} /.
Solve[{a x + y + err == b /. ab, -1/2 < err <= 1/2, {x, y} \[Element] Integers,
p1 <= {x, y} <= p2}, {x, y, err}]

];
bresenhamSolve[p1_, p2_] /;
Less @@ Abs[p2 - p1] && MatchQ[Sign[p2 - p1], {1, 1} | {0, 1}] :=
Reverse /@ bresenhamSolve[Reverse[p1], Reverse[p2]];
bresenhamSolve[p1_, p2_] :=
With[{s = 2 UnitStep[p2 - p1] - 1},
Replace[bresenhamSolve[p1 s, p2 s], {x_, y_} :> s {x, y}, {1}]];

Of course this code cannot be called terse.


This implementation is identical to halirutan's implementation:



lines = DeleteCases[Partition[#, 2] & /@ Tuples[Range[-30, 30, 6], {4}], {p_, p_}];
Length[lines]
bresenhamSolve @@@ lines == bresenham @@@ lines


14520

True

Visualization:



p1 = {2, 3}; p2 = {20, 13};
Graphics[{EdgeForm[{Thick, RGBColor[203/255, 5/17, 22/255]}],
FaceForm[RGBColor[131/255, 148/255, 10/17]],
Rectangle /@ (bresenhamSolve[p1, p2] - .5), {RGBColor[0, 43/255, 18/85], Thick,
Line[{p1, p2}]}}, GridLines -> (Range[#1, #2 + 1] & @@@ Transpose[{p1, p2}] - .5),
Frame -> True]


plot




Manipulate[Row[{Graphics[{EdgeForm[{Thick, RGBColor[203/255, 5/17, 22/255]}], 
FaceForm[RGBColor[131/255, 148/255, 10/17]],
Rectangle /@ (bresenhamSolve @@ Round[pts] - .5), {RGBColor[0, 43/255, 18/85], Thick,
Arrow@pts}}, GridLines -> ({Range[-50, 50], Range[-50, 50]} - .5), Frame -> True,
PlotRange -> {{-20, 20}, {-20, 20}}, ImageSize -> 500],
Column[Round@pts]}], {{pts, {{-11, -13}, {8, 15}}}, Locator}]


manipulate




Checking symmetry:


n = 20; center = {0, 0};
perimeterOfSquare = {x, y} /.
Solve[{x, y} \[Element]
RegionBoundary[Rectangle[{-n, -n} + center, {n, n} + center]], {x, y}, Integers];
ArrayPlot[SparseArray[
Rule @@@ Tally[# - center & /@
Flatten[bresenhamSolve[center, #] & /@ perimeterOfSquare + n + 1, 1]], {2 n + 1,
2 n + 1}], Mesh -> True, PlotRange -> {All, All, {1, 9}}, ClippingStyle -> Red,
PixelConstrained -> True]



arrayplot



Timing comparison with halirutan's implementation:


p1 = {2, 3}; p2 = {2001, 1300};
Timing[bresenhamSolve[p1, p2];]
Timing[bresenham[p1, p2];]



{0.171601, Null}

{0.0312002, Null}

My question:


Is it possible to write general implementation without splitting it into special cases and with good performance? Instead of Solve one can use other superfunction(s).




Comments

Popular posts from this blog

functions - Get leading series expansion term?

Given a function f[x] , I would like to have a function leadingSeries that returns just the leading term in the series around x=0 . For example: leadingSeries[(1/x + 2)/(4 + 1/x^2 + x)] x and leadingSeries[(1/x + 2 + (1 - 1/x^3)/4)/(4 + x)] -(1/(16 x^3)) Is there such a function in Mathematica? Or maybe one can implement it efficiently? EDIT I finally went with the following implementation, based on Carl Woll 's answer: lds[ex_,x_]:=( (ex/.x->(x+O[x]^2))/.SeriesData[U_,Z_,L_List,Mi_,Ma_,De_]:>SeriesData[U,Z,{L[[1]]},Mi,Mi+1,De]//Quiet//Normal) The advantage is, that this one also properly works with functions whose leading term is a constant: lds[Exp[x],x] 1 Answer Update 1 Updated to eliminate SeriesData and to not return additional terms Perhaps you could use: leadingSeries[expr_, x_] := Normal[expr /. x->(x+O[x]^2) /. a_List :> Take[a, 1]] Then for your examples: leadingSeries[(1/x + 2)/(4 + 1/x^2 + x), x] leadingSeries[Exp[x], x] leadingSeries[(1/x + 2 + (1 - 1/x...

mathematical optimization - Minimizing using indices, error: Part::pkspec1: The expression cannot be used as a part specification

I want to use Minimize where the variables to minimize are indices pointing into an array. Here a MWE that hopefully shows what my problem is. vars = u@# & /@ Range[3]; cons = Flatten@ { Table[(u[j] != #) & /@ vars[[j + 1 ;; -1]], {j, 1, 3 - 1}], 1 vec1 = {1, 2, 3}; vec2 = {1, 2, 3}; Minimize[{Total@((vec1[[#]] - vec2[[u[#]]])^2 & /@ Range[1, 3]), cons}, vars, Integers] The error I get: Part::pkspec1: The expression u[1] cannot be used as a part specification. >> Answer Ok, it seems that one can get around Mathematica trying to evaluate vec2[[u[1]]] too early by using the function Indexed[vec2,u[1]] . The working MWE would then look like the following: vars = u@# & /@ Range[3]; cons = Flatten@{ Table[(u[j] != #) & /@ vars[[j + 1 ;; -1]], {j, 1, 3 - 1}], 1 vec1 = {1, 2, 3}; vec2 = {1, 2, 3}; NMinimize[ {Total@((vec1[[#]] - Indexed[vec2, u[#]])^2 & /@ R...

What is and isn't a valid variable specification for Manipulate?

I have an expression whose terms have arguments (representing subscripts), like this: myExpr = A[0] + V[1,T] I would like to put it inside a Manipulate to see its value as I move around the parameters. (The goal is eventually to plot it wrt one of the variables inside.) However, Mathematica complains when I set V[1,T] as a manipulated variable: Manipulate[Evaluate[myExpr], {A[0], 0, 1}, {V[1, T], 0, 1}] (*Manipulate::vsform: Manipulate argument {V[1,T],0,1} does not have the correct form for a variable specification. >> *) As a workaround, if I get rid of the symbol T inside the argument, it works fine: Manipulate[ Evaluate[myExpr /. T -> 15], {A[0], 0, 1}, {V[1, 15], 0, 1}] Why this behavior? Can anyone point me to the documentation that says what counts as a valid variable? And is there a way to get Manpiulate to accept an expression with a symbolic argument as a variable? Investigations I've done so far: I tried using variableQ from this answer , but it says V[1...