I’ve found this thread on StackOverflow but my python understanding isn’t that good to properly translate it to C, I’m trying to add that gradient feature to this line drawing algorithm: I feel bad for asking such a trivial task but I really can’t understand what is going on on the python side nor how the colours are represented (mine
Tag: lerp
Equidistant points between two points?
I am trying to know equidistant points between two points. For example: The answer that I am expecting is: In this example, with p1, and p2: Always will be a straight line. HowManyParts in this case is the whole distance that is divided something like numpy.linspace() but in two dimensions. Answer Thanks to linearity of the line connecting two points,