[T1] "Automatic" Bezier Path Generation?

Author

Message

Clonkex

Forum Vice President

14

Years of Service

User Offline

Joined: 20th May 2010

Location: Northern Tablelands, NSW, Australia

Posted: 12th Mar 2014 08:07 Edited at: 20th Mar 2014 12:27

Link

Hi all,

This is kind of a complex subject (mathematically), so I would prefer a more conceptual answer.

Basically, I currently have bezier path code working in AGK. It works perfectly and does exactly what I tell it; but that's the issue, I can't know what to tell it.

Ok, so I want to be able to place down "control points" in realtime, and draw a smooth flowing curve between each one. This can be achieved by hand by manipulating the tangents of the curves, but I need some way to make this automatic. Here, pretty much exactly like this.

What kind of code would I use to work out where the tangent points need to be to give a smooth flow like that?

I know I haven't explained myself very well, but my brain's tired and I hope someone can work out what I'm trying to say and help me

Thanks

----------------------------------------------------------------------------------------

Update [13/03/14]: I solved the issue myself

~~Here's the code:~~ DON'T USE THIS CODE NOW. USE THE UPDATED VERSION AT THE BOTTOM OF THIS POST.

function calculatepointoncurve(t#) //t# is the percentage of the way along the line in a range of 0-1
 //[x,y]=(1-t)3P0+3(1-t)2tP1+3(1-t)t2P2+t3P3
 if curvepointcount>1
  totalt#=t#*(curvepointcount-1)
  i=trunc(totalt#)
  realt#=totalt#-i
  p1posx#=pointonlinex(curvepoint[i].posx,curvepoint[i].posy,curvepoint[i+1].posx,curvepoint[i+1].posy,0.3333)
  p1posy#=pointonliney(curvepoint[i].posx,curvepoint[i].posy,curvepoint[i+1].posx,curvepoint[i+1].posy,0.3333)
  p2posx#=pointonlinex(curvepoint[i+1].posx,curvepoint[i+1].posy,curvepoint[i].posx,curvepoint[i].posy,0.3333)
  p2posy#=pointonliney(curvepoint[i+1].posx,curvepoint[i+1].posy,curvepoint[i].posx,curvepoint[i].posy,0.3333)
  if i=0
   p0posx#=curvepoint[i].posx
   p0posy#=curvepoint[i].posy
  else
   tempx#=pointonlinex(curvepoint[i].posx,curvepoint[i].posy,curvepoint[i-1].posx,curvepoint[i-1].posy,0.3333)
   tempy#=pointonliney(curvepoint[i].posx,curvepoint[i].posy,curvepoint[i-1].posx,curvepoint[i-1].posy,0.3333)
   p0posx#=pointonlinex(tempx#,tempy#,p1posx#,p1posy#,0.5)
   p0posy#=pointonliney(tempx#,tempy#,p1posx#,p1posy#,0.5)
  endif
  if i=curvepointcount-2
   p3posx#=curvepoint[i+1].posx
   p3posy#=curvepoint[i+1].posy
  else
   tempx#=pointonlinex(curvepoint[i+1].posx,curvepoint[i+1].posy,curvepoint[i+2].posx,curvepoint[i+2].posy,0.3333)
   tempy#=pointonliney(curvepoint[i+1].posx,curvepoint[i+1].posy,curvepoint[i+2].posx,curvepoint[i+2].posy,0.3333)
   p3posx#=pointonlinex(p2posx#,p2posy#,tempx#,tempy#,0.5)
   p3posy#=pointonliney(p2posx#,p2posy#,tempx#,tempy#,0.5)
  endif
  //begin calculations (conveniently adapted from http://devmag.org.za/2011/04/05/bzier-curves-a-tutorial/):
  u#=1-realt#
  tt#=realt#*realt#
  uu#=u#*u#
  uuu#=uu#*u#
  ttt#=tt#*realt#
  lastcurvepointx#=uuu#*p0posx# //first term
  lastcurvepointy#=uuu#*p0posy# //first term
  lastcurvepointx#=lastcurvepointx#+3*uu#*realt#*p1posx# //second term
  lastcurvepointy#=lastcurvepointy#+3*uu#*realt#*p1posy# //second term
  lastcurvepointx#=lastcurvepointx#+3*u#*tt#*p2posx# //third term
  lastcurvepointy#=lastcurvepointy#+3*u#*tt#*p2posy# //third term
  lastcurvepointx#=lastcurvepointx#+ttt#*p3posx# //fourth term
  lastcurvepointy#=lastcurvepointy#+ttt#*p3posy# //fourth term
 else
  if curvepointcount>0
   lastcurvepointx#=curvepoint[0].posx
   lastcurvepointy#=curvepoint[0].posy
  else
   message("Tried to calculate a curve with no points! You dooshbag!")
   end
  endif
 endif
endfunction

+ Code Snippet

function calculatepointoncurve(t#) //t# is the percentage of the way along the line in a range of 0-1
 //[x,y]=(1-t)3P0+3(1-t)2tP1+3(1-t)t2P2+t3P3
 if curvepointcount>1
  totalt#=t#*(curvepointcount-1)
  i=trunc(totalt#)
  realt#=totalt#-i
  p1posx#=pointonlinex(curvepoint[i].posx,curvepoint[i].posy,curvepoint[i+1].posx,curvepoint[i+1].posy,0.3333)
  p1posy#=pointonliney(curvepoint[i].posx,curvepoint[i].posy,curvepoint[i+1].posx,curvepoint[i+1].posy,0.3333)
  p2posx#=pointonlinex(curvepoint[i+1].posx,curvepoint[i+1].posy,curvepoint[i].posx,curvepoint[i].posy,0.3333)
  p2posy#=pointonliney(curvepoint[i+1].posx,curvepoint[i+1].posy,curvepoint[i].posx,curvepoint[i].posy,0.3333)
  if i=0
   p0posx#=curvepoint[i].posx
   p0posy#=curvepoint[i].posy
  else
   tempx#=pointonlinex(curvepoint[i].posx,curvepoint[i].posy,curvepoint[i-1].posx,curvepoint[i-1].posy,0.3333)
   tempy#=pointonliney(curvepoint[i].posx,curvepoint[i].posy,curvepoint[i-1].posx,curvepoint[i-1].posy,0.3333)
   p0posx#=pointonlinex(tempx#,tempy#,p1posx#,p1posy#,0.5)
   p0posy#=pointonliney(tempx#,tempy#,p1posx#,p1posy#,0.5)
  endif
  if i=curvepointcount-2
   p3posx#=curvepoint[i+1].posx
   p3posy#=curvepoint[i+1].posy
  else
   tempx#=pointonlinex(curvepoint[i+1].posx,curvepoint[i+1].posy,curvepoint[i+2].posx,curvepoint[i+2].posy,0.3333)
   tempy#=pointonliney(curvepoint[i+1].posx,curvepoint[i+1].posy,curvepoint[i+2].posx,curvepoint[i+2].posy,0.3333)
   p3posx#=pointonlinex(p2posx#,p2posy#,tempx#,tempy#,0.5)
   p3posy#=pointonliney(p2posx#,p2posy#,tempx#,tempy#,0.5)
  endif
  //begin calculations (conveniently adapted from http://devmag.org.za/2011/04/05/bzier-curves-a-tutorial/):
  u#=1-realt#
  tt#=realt#*realt#
  uu#=u#*u#
  uuu#=uu#*u#
  ttt#=tt#*realt#
  lastcurvepointx#=uuu#*p0posx# //first term
  lastcurvepointy#=uuu#*p0posy# //first term
  lastcurvepointx#=lastcurvepointx#+3*uu#*realt#*p1posx# //second term
  lastcurvepointy#=lastcurvepointy#+3*uu#*realt#*p1posy# //second term
  lastcurvepointx#=lastcurvepointx#+3*u#*tt#*p2posx# //third term
  lastcurvepointy#=lastcurvepointy#+3*u#*tt#*p2posy# //third term
  lastcurvepointx#=lastcurvepointx#+ttt#*p3posx# //fourth term
  lastcurvepointy#=lastcurvepointy#+ttt#*p3posy# //fourth term
 else
  if curvepointcount>0
   lastcurvepointx#=curvepoint[0].posx
   lastcurvepointy#=curvepoint[0].posy
  else
   message("Tried to calculate a curve with no points! You dooshbag!")
   end
  endif
 endif
endfunction

curvepoint is defined as such:

+ Code Snippet

type curvepointinfo
 posx as integer
 posy as integer
endtype

dim curvepoint[0] as curvepointinfo

More info on code usage in this post.

----------------------------------------------------------------------------------------

Update [16/03/14]: AGAIN, DON'T USE THIS CODE ANY MORE - THERE'S A BETTER VERSION HERE More changes to the code. Well, not so much changes as I didn't realise I hadn't included some of the functions used by my bezier code....so here is the latest version. Also included now is a function that finds to closest point on the curve to a specific point elsewhere. You should define 4 globals:

+ Code Snippet

global distanceiterations=50
global closestdistance#=0.0
global closestpointx#=0.0
global closestpointy#=0.0

The distance-to-curve function uses a pretty basic brute-force method, so it could probably be faster, but you can change distanceiterations to adjust how accurate (and how slow) the function is at finding the closest point.

function calculatepointoncurve(t#) //t# is the percentage of the way along the line in a range of 0-1
 if curvepointcount>1
  //print("start timing")
  //pasttime#=timer()
  totalt#=t#*(curvepointcount-1)
  i=trunc(totalt#)
  realt#=totalt#-i
  p1posx#=pointonlinex(curvepoint[i].posx,curvepoint[i].posy,curvepoint[i+1].posx,curvepoint[i+1].posy,0.3333)
  p1posy#=pointonliney(curvepoint[i].posx,curvepoint[i].posy,curvepoint[i+1].posx,curvepoint[i+1].posy,0.3333)
  p2posx#=pointonlinex(curvepoint[i+1].posx,curvepoint[i+1].posy,curvepoint[i].posx,curvepoint[i].posy,0.3333)
  p2posy#=pointonliney(curvepoint[i+1].posx,curvepoint[i+1].posy,curvepoint[i].posx,curvepoint[i].posy,0.3333)
  //time#=timer()
  //print("time 0-1: "+str((time#-pasttime#)*1000))
  //pasttime#=time#
  if i=0
   p0posx#=curvepoint[i].posx
   p0posy#=curvepoint[i].posy
  else
   tempx#=pointonlinex(curvepoint[i].posx,curvepoint[i].posy,curvepoint[i-1].posx,curvepoint[i-1].posy,0.3333)
   tempy#=pointonliney(curvepoint[i].posx,curvepoint[i].posy,curvepoint[i-1].posx,curvepoint[i-1].posy,0.3333)
   p0posx#=pointonlinex(tempx#,tempy#,p1posx#,p1posy#,0.5)
   p0posy#=pointonliney(tempx#,tempy#,p1posx#,p1posy#,0.5)
  endif
  //time#=timer()
  //print("time 1-2: "+str((time#-pasttime#)*1000))
  //pasttime#=time#
  if i=curvepointcount-2
   p3posx#=curvepoint[i+1].posx
   p3posy#=curvepoint[i+1].posy
  else
   tempx#=pointonlinex(curvepoint[i+1].posx,curvepoint[i+1].posy,curvepoint[i+2].posx,curvepoint[i+2].posy,0.3333)
   tempy#=pointonliney(curvepoint[i+1].posx,curvepoint[i+1].posy,curvepoint[i+2].posx,curvepoint[i+2].posy,0.3333)
   p3posx#=pointonlinex(p2posx#,p2posy#,tempx#,tempy#,0.5)
   p3posy#=pointonliney(p2posx#,p2posy#,tempx#,tempy#,0.5)
  endif
  //time#=timer()
  //print("time 2-3: "+str((time#-pasttime#)*1000))
  //pasttime#=time#
  //begin calculations (conveniently adapted from http://devmag.org.za/2011/04/05/bzier-curves-a-tutorial/):
  u#=1-realt#
  tt#=realt#*realt#
  uu#=u#*u#
  uuu#=uu#*u#
  ttt#=tt#*realt#
  lastcurvepointx#=uuu#*p0posx# //first term
  lastcurvepointy#=uuu#*p0posy# //first term
  lastcurvepointx#=lastcurvepointx#+3*uu#*realt#*p1posx# //second term
  lastcurvepointy#=lastcurvepointy#+3*uu#*realt#*p1posy# //second term
  lastcurvepointx#=lastcurvepointx#+3*u#*tt#*p2posx# //third term
  lastcurvepointy#=lastcurvepointy#+3*u#*tt#*p2posy# //third term
  lastcurvepointx#=lastcurvepointx#+ttt#*p3posx# //fourth term
  lastcurvepointy#=lastcurvepointy#+ttt#*p3posy# //fourth term
  //time#=timer()
  //print("time 3-4: "+str((time#-pasttime#)*1000))
  //pasttime#=time#
  //print("end timing")
  //sync()
  //waitkey()
 else
  if curvepointcount>0
   lastcurvepointx#=curvepoint[0].posx
   lastcurvepointy#=curvepoint[0].posy
  else
   message("Tried to calculate a curve with no points! You douchebag!")
   end
  endif
 endif
endfunction

function calculateclosestpointtocurve(x#,y#) //x# and y# are the point from which we're searching
 closestdistance#=1000000 //hack, but basically could never be larger than this anyway
 if curvepointcount>0
  closestpointx#=0
  closestpointy#=0
  add#=1.0/distanceiterations
  t#=0
  for d=0 to distanceiterations-1
   calculatepointoncurve(t#)
   //distance#=ufp_distance2(x#,y#,lastcurvepointx#,lastcurvepointy#)
   distance#=sqrt((x#-lastcurvepointx#)*(x#-lastcurvepointx#)+(y#-lastcurvepointy#)*(y#-lastcurvepointy#))
   if distance#<closestdistance#
    closestdistance#=distance#
    closestpointx#=lastcurvepointx#
    closestpointy#=lastcurvepointy#
   endif
   t#=t#+add#
  next d
 endif
endfunction

function pointonlinex(x1#,y1#,x2#,y2#,percent#)
 px#=x1#+((x2#-x1#)*percent#)
endfunction px#

function pointonliney(x1#,y1#,x2#,y2#,percent#)
 py#=y1#+((y2#-y1#)*percent#)
endfunction py#

+ Code Snippet

function calculatepointoncurve(t#) //t# is the percentage of the way along the line in a range of 0-1
 if curvepointcount>1
  //print("start timing")
  //pasttime#=timer()
  totalt#=t#*(curvepointcount-1)
  i=trunc(totalt#)
  realt#=totalt#-i
  p1posx#=pointonlinex(curvepoint[i].posx,curvepoint[i].posy,curvepoint[i+1].posx,curvepoint[i+1].posy,0.3333)
  p1posy#=pointonliney(curvepoint[i].posx,curvepoint[i].posy,curvepoint[i+1].posx,curvepoint[i+1].posy,0.3333)
  p2posx#=pointonlinex(curvepoint[i+1].posx,curvepoint[i+1].posy,curvepoint[i].posx,curvepoint[i].posy,0.3333)
  p2posy#=pointonliney(curvepoint[i+1].posx,curvepoint[i+1].posy,curvepoint[i].posx,curvepoint[i].posy,0.3333)
  //time#=timer()
  //print("time 0-1: "+str((time#-pasttime#)*1000))
  //pasttime#=time#
  if i=0
   p0posx#=curvepoint[i].posx
   p0posy#=curvepoint[i].posy
  else
   tempx#=pointonlinex(curvepoint[i].posx,curvepoint[i].posy,curvepoint[i-1].posx,curvepoint[i-1].posy,0.3333)
   tempy#=pointonliney(curvepoint[i].posx,curvepoint[i].posy,curvepoint[i-1].posx,curvepoint[i-1].posy,0.3333)
   p0posx#=pointonlinex(tempx#,tempy#,p1posx#,p1posy#,0.5)
   p0posy#=pointonliney(tempx#,tempy#,p1posx#,p1posy#,0.5)
  endif
  //time#=timer()
  //print("time 1-2: "+str((time#-pasttime#)*1000))
  //pasttime#=time#
  if i=curvepointcount-2
   p3posx#=curvepoint[i+1].posx
   p3posy#=curvepoint[i+1].posy
  else
   tempx#=pointonlinex(curvepoint[i+1].posx,curvepoint[i+1].posy,curvepoint[i+2].posx,curvepoint[i+2].posy,0.3333)
   tempy#=pointonliney(curvepoint[i+1].posx,curvepoint[i+1].posy,curvepoint[i+2].posx,curvepoint[i+2].posy,0.3333)
   p3posx#=pointonlinex(p2posx#,p2posy#,tempx#,tempy#,0.5)
   p3posy#=pointonliney(p2posx#,p2posy#,tempx#,tempy#,0.5)
  endif
  //time#=timer()
  //print("time 2-3: "+str((time#-pasttime#)*1000))
  //pasttime#=time#
  //begin calculations (conveniently adapted from http://devmag.org.za/2011/04/05/bzier-curves-a-tutorial/):
  u#=1-realt#
  tt#=realt#*realt#
  uu#=u#*u#
  uuu#=uu#*u#
  ttt#=tt#*realt#
  lastcurvepointx#=uuu#*p0posx# //first term
  lastcurvepointy#=uuu#*p0posy# //first term
  lastcurvepointx#=lastcurvepointx#+3*uu#*realt#*p1posx# //second term
  lastcurvepointy#=lastcurvepointy#+3*uu#*realt#*p1posy# //second term
  lastcurvepointx#=lastcurvepointx#+3*u#*tt#*p2posx# //third term
  lastcurvepointy#=lastcurvepointy#+3*u#*tt#*p2posy# //third term
  lastcurvepointx#=lastcurvepointx#+ttt#*p3posx# //fourth term
  lastcurvepointy#=lastcurvepointy#+ttt#*p3posy# //fourth term
  //time#=timer()
  //print("time 3-4: "+str((time#-pasttime#)*1000))
  //pasttime#=time#
  //print("end timing")
  //sync()
  //waitkey()
 else
  if curvepointcount>0
   lastcurvepointx#=curvepoint[0].posx
   lastcurvepointy#=curvepoint[0].posy
  else
   message("Tried to calculate a curve with no points! You douchebag!")
   end
  endif
 endif
endfunction

function calculateclosestpointtocurve(x#,y#) //x# and y# are the point from which we're searching
 closestdistance#=1000000 //hack, but basically could never be larger than this anyway
 if curvepointcount>0
  closestpointx#=0
  closestpointy#=0
  add#=1.0/distanceiterations
  t#=0
  for d=0 to distanceiterations-1
   calculatepointoncurve(t#)
   //distance#=ufp_distance2(x#,y#,lastcurvepointx#,lastcurvepointy#)
   distance#=sqrt((x#-lastcurvepointx#)*(x#-lastcurvepointx#)+(y#-lastcurvepointy#)*(y#-lastcurvepointy#))
   if distance#<closestdistance#
    closestdistance#=distance#
    closestpointx#=lastcurvepointx#
    closestpointy#=lastcurvepointy#
   endif
   t#=t#+add#
  next d
 endif
endfunction

function pointonlinex(x1#,y1#,x2#,y2#,percent#)
 px#=x1#+((x2#-x1#)*percent#)
endfunction px#

function pointonliney(x1#,y1#,x2#,y2#,percent#)
 py#=y1#+((y2#-y1#)*percent#)
endfunction py#

This post still applies for setting up and using the code.

Placement Editor Professional
Code Line Counter

Back to top

Profile PM Email

Markus

Valued Member

20

Years of Service

User Offline

Joined: 10th Apr 2004

Location: Germany

Posted: 12th Mar 2014 09:03

Link

4 point bezier is much more easier, the curve go exactly through points.
its a simple function, i have at home.

AGK 108 (B)19 : Windows 8.1 Pro 64 Bit : AMD Radeon HD 6670

Back to top

Profile PM Email

Clonkex

Forum Vice President

14

Years of Service

User Offline

Joined: 20th May 2010

Location: Northern Tablelands, NSW, Australia

Posted: 12th Mar 2014 09:29

Link

What do you mean by "4 point"? I'm currently using a cubic bezier, points 0 & 3 are the end points and 1 & 2 are tangent points. I'd appreciate any code you can throw at me

Placement Editor Professional
Code Line Counter

Back to top

Profile PM Email

Markus

Valued Member

20

Years of Service

User Offline

Joined: 10th Apr 2004

Location: Germany

Posted: 12th Mar 2014 09:47 Edited at: 12th Mar 2014 15:31

Link

i believe this bezier i had used , the curve gone through this 4 points.
if not i remember i had use something similar, i can give u later.
see attachment

AGK 108 (B)19 : Windows 8.1 Pro 64 Bit : AMD Radeon HD 6670

Attachments

Login to view attachments

Back to top

Profile PM Email

Clonkex

Forum Vice President

14

Years of Service

User Offline

Joined: 20th May 2010

Location: Northern Tablelands, NSW, Australia

Posted: 12th Mar 2014 12:09

Link

What you have in the image there looks to be what I'm trying to achieve.

Placement Editor Professional
Code Line Counter

Back to top

Profile PM Email

baxslash

Valued Member

Bronze Codemaster

17

Years of Service

User Offline

Joined: 26th Dec 2006

Location: Duffield

Posted: 12th Mar 2014 12:37

Link

This might help:

+ Code Snippet

rem full function for getting a bezier curve x component
rem where points x1,y1 and x2,y2 are the start/end points
rem and c1x,c1y and c2x,c2y are the control points
function getPointXOnBezier(x1#, y1#, x2#, y2#, c1x#, c1y#, c2x#, c2y#, v#)
	cx# = 3 * (c1x# - x1#)
	bx# = 3 * (c2x# - c1x#) - cx#
	ax# = x2# - x1# - cx# - bx#
	x# = ((ax# * v# + bx#) * v# + cx#) * v# + x1#
endfunction x#

rem full function for getting a bezier curve y component
function getPointYOnBezier(x1#, y1#, x2#, y2#, c1x#, c1y#, c2x#, c2y#, v#)
	cy# = 3 * (c1y# - y1#)
	by# = 3 * (c2y# - c1y#) - cy#
	ay# = y2# - y1# - cy# - by#
	y# = ((ay# * v# + by#) * v# + cy#) * v# + y1#
endfunction y#

Back to top

Profile PM Email

Clonkex

Forum Vice President

14

Years of Service

User Offline

Joined: 20th May 2010

Location: Northern Tablelands, NSW, Australia

Posted: 12th Mar 2014 12:53

Link

Ah, but that uses control points, right? That's virtually the system I have now, only mine's easier to use, but I need a control-point-less system.

After some more research I've realised what I need is more correctly called spline interpolation. I just need something that takes a set of (x,y) points and a distance along the line and returns the (x,y) position at that point along the line. The line needs to be a smooth, flowing curve passing through every point. Like this, but something that can also go in circles.

Placement Editor Professional
Code Line Counter

Back to top

Profile PM Email

JohnnyMeek

11

Years of Service

User Offline

Joined: 23rd Apr 2013

Location: Slovenia

Posted: 12th Mar 2014 13:08

Link

I had a similar issue, and started out using Bezier but couldn't calculate the control points.

In the end I went with a Catmull curve instead. It will give you a nice curve between all (4) points, and always travels through the points.

+ Code Snippet

FUNCTION CatMullCurve (  p0 AS FLOAT,p1 AS FLOAT,p2 AS FLOAT,p3 AS FLOAT, t1 AS FLOAT )

    t2 AS FLOAT
    t3 AS FLOAT

    t2 = t1 * t1
    t3 = t1 * t1 * t1

    point# = ( ( p1 * 2 ) + ( p2   - p0 ) * t1 + ( p0 * 2 - p1 * 5 +  p2 * 4 - p3 ) * t2 + ( p1 * 3 - p2 * 3 +  p3   - p0 ) * t3 ) * 0.5

ENDFUNCTION point#

Back to top

Profile PM

Clonkex

Forum Vice President

14

Years of Service

User Offline

Joined: 20th May 2010

Location: Northern Tablelands, NSW, Australia

Posted: 12th Mar 2014 13:27 Edited at: 12th Mar 2014 13:28

Link

Quote: "I had a similar issue, and started out using Bezier but couldn't calculate the control points.

In the end I went with a Catmull curve instead. It will give you a nice curve between all (4) points, and always travels through the points."

Thanks, that's very helpful indeed (concept-wise), but I need to be able to place an arbitrary number of points and I see no way of easily using the Catmull curve for this

However, I have come up with a cunning plan of my own. Well, I saw it in the picture on page 11

Implementing this is going to fry my brain, though, so wish me luck

Placement Editor Professional
Code Line Counter

Back to top

Profile PM Email

Clonkex

Forum Vice President

14

Years of Service

User Offline

Joined: 20th May 2010

Location: Northern Tablelands, NSW, Australia

Posted: 12th Mar 2014 14:27 Edited at: 13th Mar 2014 09:07

Link

Ok, I solved it (and my brain didn't melt!

). This is the code:

WARNING! DON'T USE THIS CODE! IT'S SEVERELY BUGGED!

function calculatepointoncurve(t#) //t# is the percentage of the way along the line in a range of 0-1
 //[x,y]=(1-t)3P0+3(1-t)2tP1+3(1-t)t2P2+t3P3
 if curvepointcount>1
  totalt#=t#*curvepointcount
  i=trunc(totalt#)
  realt#=totalt#-i
  p1posx=pointonlinex(curvepoint[i].posx,curvepoint[i].posy,curvepoint[i+1].posx,curvepoint[i+1].posy,0.3333)
  p1posy=pointonliney(curvepoint[i].posx,curvepoint[i].posy,curvepoint[i+1].posx,curvepoint[i+1].posy,0.3333)
  p2posx=pointonlinex(curvepoint[i+1].posx,curvepoint[i+1].posy,curvepoint[i].posx,curvepoint[i].posy,0.3333)
  p2posy=pointonliney(curvepoint[i+1].posx,curvepoint[i+1].posy,curvepoint[i].posx,curvepoint[i].posy,0.3333)
  if i=0
   p0posx=curvepoint[i].posx
   p0posy=curvepoint[i].posy
  else
   tempx=pointonlinex(curvepoint[i].posx,curvepoint[i].posy,curvepoint[i-1].posx,curvepoint[i-1].posy,0.3333)
   tempy=pointonliney(curvepoint[i].posx,curvepoint[i].posy,curvepoint[i-1].posx,curvepoint[i-1].posy,0.3333)
   p0posx=pointonlinex(tempx,tempy,p1posx,p1posy,0.5)
   p0posy=pointonliney(tempx,tempy,p1posx,p1posy,0.5)
  endif
  if i+1=curvepointcount-1
   p3posx=curvepoint[i+1].posx
   p3posy=curvepoint[i+1].posy
  else
   tempx=pointonlinex(curvepoint[i+1].posx,curvepoint[i+1].posy,curvepoint[i+2].posx,curvepoint[i+2].posy,0.3333)
   tempy=pointonliney(curvepoint[i+1].posx,curvepoint[i+1].posy,curvepoint[i+2].posx,curvepoint[i+2].posy,0.3333)
   p3posx=pointonlinex(p2posx,p2posy,tempx,tempy,0.5)
   p3posy=pointonliney(p2posx,p2posy,tempx,tempy,0.5)
  endif
  //begin calculations (conveniently adapted from http://devmag.org.za/2011/04/05/bzier-curves-a-tutorial/):
  u#=1-realt#
  tt#=realt#*realt#
  uu#=u#*u#
  uuu#=uu#*u#
  ttt#=tt#*realt#
  lastcurvepointx#=uuu#*p0posx //first term
  lastcurvepointy#=uuu#*p0posy //first term
  lastcurvepointx#=lastcurvepointx#+3*uu#*realt#*p1posx //second term
  lastcurvepointy#=lastcurvepointy#+3*uu#*realt#*p1posy //second term
  lastcurvepointx#=lastcurvepointx#+3*u#*tt#*p2posx //third term
  lastcurvepointy#=lastcurvepointy#+3*u#*tt#*p2posy //third term
  lastcurvepointx#=lastcurvepointx#+ttt#*p3posx //fourth term
  lastcurvepointy#=lastcurvepointy#+ttt#*p3posy //fourth term
 else
  lastcurvepointx#=0
  lastcurvepointy#=0
 endif
endfunction

function pointonlinex(x1#,y1#,x2#,y2#,percent#)
 px#=x1#+((x2#-x1#)*percent#)
endfunction px#

function pointonliney(x1#,y1#,x2#,y2#,percent#)
 py#=y1#+((y2#-y1#)*percent#)
endfunction py#

+ Code Snippet

function calculatepointoncurve(t#) //t# is the percentage of the way along the line in a range of 0-1
 //[x,y]=(1-t)3P0+3(1-t)2tP1+3(1-t)t2P2+t3P3
 if curvepointcount>1
  totalt#=t#*curvepointcount
  i=trunc(totalt#)
  realt#=totalt#-i
  p1posx=pointonlinex(curvepoint[i].posx,curvepoint[i].posy,curvepoint[i+1].posx,curvepoint[i+1].posy,0.3333)
  p1posy=pointonliney(curvepoint[i].posx,curvepoint[i].posy,curvepoint[i+1].posx,curvepoint[i+1].posy,0.3333)
  p2posx=pointonlinex(curvepoint[i+1].posx,curvepoint[i+1].posy,curvepoint[i].posx,curvepoint[i].posy,0.3333)
  p2posy=pointonliney(curvepoint[i+1].posx,curvepoint[i+1].posy,curvepoint[i].posx,curvepoint[i].posy,0.3333)
  if i=0
   p0posx=curvepoint[i].posx
   p0posy=curvepoint[i].posy
  else
   tempx=pointonlinex(curvepoint[i].posx,curvepoint[i].posy,curvepoint[i-1].posx,curvepoint[i-1].posy,0.3333)
   tempy=pointonliney(curvepoint[i].posx,curvepoint[i].posy,curvepoint[i-1].posx,curvepoint[i-1].posy,0.3333)
   p0posx=pointonlinex(tempx,tempy,p1posx,p1posy,0.5)
   p0posy=pointonliney(tempx,tempy,p1posx,p1posy,0.5)
  endif
  if i+1=curvepointcount-1
   p3posx=curvepoint[i+1].posx
   p3posy=curvepoint[i+1].posy
  else
   tempx=pointonlinex(curvepoint[i+1].posx,curvepoint[i+1].posy,curvepoint[i+2].posx,curvepoint[i+2].posy,0.3333)
   tempy=pointonliney(curvepoint[i+1].posx,curvepoint[i+1].posy,curvepoint[i+2].posx,curvepoint[i+2].posy,0.3333)
   p3posx=pointonlinex(p2posx,p2posy,tempx,tempy,0.5)
   p3posy=pointonliney(p2posx,p2posy,tempx,tempy,0.5)
  endif
  //begin calculations (conveniently adapted from http://devmag.org.za/2011/04/05/bzier-curves-a-tutorial/):
  u#=1-realt#
  tt#=realt#*realt#
  uu#=u#*u#
  uuu#=uu#*u#
  ttt#=tt#*realt#
  lastcurvepointx#=uuu#*p0posx //first term
  lastcurvepointy#=uuu#*p0posy //first term
  lastcurvepointx#=lastcurvepointx#+3*uu#*realt#*p1posx //second term
  lastcurvepointy#=lastcurvepointy#+3*uu#*realt#*p1posy //second term
  lastcurvepointx#=lastcurvepointx#+3*u#*tt#*p2posx //third term
  lastcurvepointy#=lastcurvepointy#+3*u#*tt#*p2posy //third term
  lastcurvepointx#=lastcurvepointx#+ttt#*p3posx //fourth term
  lastcurvepointy#=lastcurvepointy#+ttt#*p3posy //fourth term
 else
  lastcurvepointx#=0
  lastcurvepointy#=0
 endif
endfunction

function pointonlinex(x1#,y1#,x2#,y2#,percent#)
 px#=x1#+((x2#-x1#)*percent#)
endfunction px#

function pointonliney(x1#,y1#,x2#,y2#,percent#)
 py#=y1#+((y2#-y1#)*percent#)
endfunction py#

It seems to work perfectly, except occasionally when one or two "dots" (what I'm drawing the curve as) appear at random places on the screen - probably just a little bug, I'll go through the code carefully later.

For anyone else using the code, curvepoint is defined like so:

+ Code Snippet

type curvepointinfo
 posx as integer
 posy as integer
endtype

dim curvepoint[0] as curvepointinfo

Each point is simply a point, there's no control points or anything. The curve will start at the first point in the array and flow smoothly past/through each point.

Also, I realised I actually want my curve to NOT flow directly through each point but flow past them. As a result, you can increase or decrease the 0.3333 values (which could be moved to variables for easier changing) to relax or stiffen the corners, but 0.3333 is the smoothest.

Lastly, if you need the curve to be a closed loop, you could just make the endpoints join (which I will almost certainly be doing anyway, so you can have that code as well when I finish it).

The next thing I have to do is work out how to find the closest point to a bezier curve, which, luckily, I should be able to do, because my system is built on normal cubic bezier curves. The difficulty will be finding information on how to actually implement such a thing in code

Placement Editor Professional
Code Line Counter

Back to top

Profile PM Email

baxslash

Valued Member

Bronze Codemaster

17

Years of Service

User Offline

Joined: 26th Dec 2006

Location: Duffield

Posted: 12th Mar 2014 15:29

Link

That looks nice and easy to use. Thanks for sharing

Back to top

Profile PM Email

Clonkex

Forum Vice President

14

Years of Service

User Offline

Joined: 20th May 2010

Location: Northern Tablelands, NSW, Australia

Posted: 13th Mar 2014 06:20

Link

Quote: "That looks nice and easy to use. Thanks for sharing"

No problem, I like to share my work

I've decided to go for a brute-force method rather than a clever method for solving closest point on the line. Hopefully it will be fast enough, but if not, it shouldn't be impossible to use a calculated method.

Placement Editor Professional
Code Line Counter

Back to top

Profile PM Email

Clonkex

Forum Vice President

14

Years of Service

User Offline

Joined: 20th May 2010

Location: Northern Tablelands, NSW, Australia

Posted: 13th Mar 2014 07:56 Edited at: 13th Mar 2014 08:04

Link

Update: I recommend NOT using the code I posted above just yet. I found a pretty severe bug which calculates the ends of the curves completely wrongly. It's my fault and a pretty easy fix, I just have to find the exact location of the fault and I'll post the updated code

Placement Editor Professional
Code Line Counter

Back to top

Profile PM Email

Clonkex

Forum Vice President

14

Years of Service

User Offline

Joined: 20th May 2010

Location: Northern Tablelands, NSW, Australia

Posted: 13th Mar 2014 08:59

Link

Update: Here's the latest code, with bug fixes. Now no longer incorrectly calculates the final curve point.

function calculatepointoncurve(t#) //t# is the percentage of the way along the line in a range of 0-1
 //[x,y]=(1-t)3P0+3(1-t)2tP1+3(1-t)t2P2+t3P3
 if curvepointcount>1
  totalt#=t#*(curvepointcount-1)
  i=trunc(totalt#)
  realt#=totalt#-i
  p1posx#=pointonlinex(curvepoint[i].posx,curvepoint[i].posy,curvepoint[i+1].posx,curvepoint[i+1].posy,0.3333)
  p1posy#=pointonliney(curvepoint[i].posx,curvepoint[i].posy,curvepoint[i+1].posx,curvepoint[i+1].posy,0.3333)
  p2posx#=pointonlinex(curvepoint[i+1].posx,curvepoint[i+1].posy,curvepoint[i].posx,curvepoint[i].posy,0.3333)
  p2posy#=pointonliney(curvepoint[i+1].posx,curvepoint[i+1].posy,curvepoint[i].posx,curvepoint[i].posy,0.3333)
  if i=0
   p0posx#=curvepoint[i].posx
   p0posy#=curvepoint[i].posy
  else
   tempx#=pointonlinex(curvepoint[i].posx,curvepoint[i].posy,curvepoint[i-1].posx,curvepoint[i-1].posy,0.3333)
   tempy#=pointonliney(curvepoint[i].posx,curvepoint[i].posy,curvepoint[i-1].posx,curvepoint[i-1].posy,0.3333)
   p0posx#=pointonlinex(tempx#,tempy#,p1posx#,p1posy#,0.5)
   p0posy#=pointonliney(tempx#,tempy#,p1posx#,p1posy#,0.5)
  endif
  if i=curvepointcount-2
   p3posx#=curvepoint[i+1].posx
   p3posy#=curvepoint[i+1].posy
  else
   tempx#=pointonlinex(curvepoint[i+1].posx,curvepoint[i+1].posy,curvepoint[i+2].posx,curvepoint[i+2].posy,0.3333)
   tempy#=pointonliney(curvepoint[i+1].posx,curvepoint[i+1].posy,curvepoint[i+2].posx,curvepoint[i+2].posy,0.3333)
   p3posx#=pointonlinex(p2posx#,p2posy#,tempx#,tempy#,0.5)
   p3posy#=pointonliney(p2posx#,p2posy#,tempx#,tempy#,0.5)
  endif
  //begin calculations (conveniently adapted from http://devmag.org.za/2011/04/05/bzier-curves-a-tutorial/):
  u#=1-realt#
  tt#=realt#*realt#
  uu#=u#*u#
  uuu#=uu#*u#
  ttt#=tt#*realt#
  lastcurvepointx#=uuu#*p0posx# //first term
  lastcurvepointy#=uuu#*p0posy# //first term
  lastcurvepointx#=lastcurvepointx#+3*uu#*realt#*p1posx# //second term
  lastcurvepointy#=lastcurvepointy#+3*uu#*realt#*p1posy# //second term
  lastcurvepointx#=lastcurvepointx#+3*u#*tt#*p2posx# //third term
  lastcurvepointy#=lastcurvepointy#+3*u#*tt#*p2posy# //third term
  lastcurvepointx#=lastcurvepointx#+ttt#*p3posx# //fourth term
  lastcurvepointy#=lastcurvepointy#+ttt#*p3posy# //fourth term
 else
  if curvepointcount>0
   lastcurvepointx#=curvepoint[0].posx
   lastcurvepointy#=curvepoint[0].posy
  else
   message("Tried to calculate a curve with no points! You dooshbag!")
   end
  endif
 endif
endfunction

+ Code Snippet

function calculatepointoncurve(t#) //t# is the percentage of the way along the line in a range of 0-1
 //[x,y]=(1-t)3P0+3(1-t)2tP1+3(1-t)t2P2+t3P3
 if curvepointcount>1
  totalt#=t#*(curvepointcount-1)
  i=trunc(totalt#)
  realt#=totalt#-i
  p1posx#=pointonlinex(curvepoint[i].posx,curvepoint[i].posy,curvepoint[i+1].posx,curvepoint[i+1].posy,0.3333)
  p1posy#=pointonliney(curvepoint[i].posx,curvepoint[i].posy,curvepoint[i+1].posx,curvepoint[i+1].posy,0.3333)
  p2posx#=pointonlinex(curvepoint[i+1].posx,curvepoint[i+1].posy,curvepoint[i].posx,curvepoint[i].posy,0.3333)
  p2posy#=pointonliney(curvepoint[i+1].posx,curvepoint[i+1].posy,curvepoint[i].posx,curvepoint[i].posy,0.3333)
  if i=0
   p0posx#=curvepoint[i].posx
   p0posy#=curvepoint[i].posy
  else
   tempx#=pointonlinex(curvepoint[i].posx,curvepoint[i].posy,curvepoint[i-1].posx,curvepoint[i-1].posy,0.3333)
   tempy#=pointonliney(curvepoint[i].posx,curvepoint[i].posy,curvepoint[i-1].posx,curvepoint[i-1].posy,0.3333)
   p0posx#=pointonlinex(tempx#,tempy#,p1posx#,p1posy#,0.5)
   p0posy#=pointonliney(tempx#,tempy#,p1posx#,p1posy#,0.5)
  endif
  if i=curvepointcount-2
   p3posx#=curvepoint[i+1].posx
   p3posy#=curvepoint[i+1].posy
  else
   tempx#=pointonlinex(curvepoint[i+1].posx,curvepoint[i+1].posy,curvepoint[i+2].posx,curvepoint[i+2].posy,0.3333)
   tempy#=pointonliney(curvepoint[i+1].posx,curvepoint[i+1].posy,curvepoint[i+2].posx,curvepoint[i+2].posy,0.3333)
   p3posx#=pointonlinex(p2posx#,p2posy#,tempx#,tempy#,0.5)
   p3posy#=pointonliney(p2posx#,p2posy#,tempx#,tempy#,0.5)
  endif
  //begin calculations (conveniently adapted from http://devmag.org.za/2011/04/05/bzier-curves-a-tutorial/):
  u#=1-realt#
  tt#=realt#*realt#
  uu#=u#*u#
  uuu#=uu#*u#
  ttt#=tt#*realt#
  lastcurvepointx#=uuu#*p0posx# //first term
  lastcurvepointy#=uuu#*p0posy# //first term
  lastcurvepointx#=lastcurvepointx#+3*uu#*realt#*p1posx# //second term
  lastcurvepointy#=lastcurvepointy#+3*uu#*realt#*p1posy# //second term
  lastcurvepointx#=lastcurvepointx#+3*u#*tt#*p2posx# //third term
  lastcurvepointy#=lastcurvepointy#+3*u#*tt#*p2posy# //third term
  lastcurvepointx#=lastcurvepointx#+ttt#*p3posx# //fourth term
  lastcurvepointy#=lastcurvepointy#+ttt#*p3posy# //fourth term
 else
  if curvepointcount>0
   lastcurvepointx#=curvepoint[0].posx
   lastcurvepointy#=curvepoint[0].posy
  else
   message("Tried to calculate a curve with no points! You dooshbag!")
   end
  endif
 endif
endfunction

Placement Editor Professional
Code Line Counter

Back to top

Profile PM Email

Clonkex

Forum Vice President

14

Years of Service

User Offline

Joined: 20th May 2010

Location: Northern Tablelands, NSW, Australia

Posted: 16th Mar 2014 12:37

Link

Update: More changes to the code. Well, not so much changes as I didn't realise I hadn't included some of the functions used by my bezier code....so here is the latest version. Also included now is a function that finds to closest point on the curve to a specific point elsewhere. You should define 4 globals:

+ Code Snippet

global distanceiterations=50
global closestdistance#=0.0
global closestpointx#=0.0
global closestpointy#=0.0

The distance-to-curve function uses a pretty basic brute-force method, so it could probably be faster, but you can change distanceiterations to adjust how accurate (and how slow) the function is at finding the closest point.

function calculatepointoncurve(t#) //t# is the percentage of the way along the line in a range of 0-1
 if curvepointcount>1
  //print("start timing")
  //pasttime#=timer()
  totalt#=t#*(curvepointcount-1)
  i=trunc(totalt#)
  realt#=totalt#-i
  p1posx#=pointonlinex(curvepoint[i].posx,curvepoint[i].posy,curvepoint[i+1].posx,curvepoint[i+1].posy,0.3333)
  p1posy#=pointonliney(curvepoint[i].posx,curvepoint[i].posy,curvepoint[i+1].posx,curvepoint[i+1].posy,0.3333)
  p2posx#=pointonlinex(curvepoint[i+1].posx,curvepoint[i+1].posy,curvepoint[i].posx,curvepoint[i].posy,0.3333)
  p2posy#=pointonliney(curvepoint[i+1].posx,curvepoint[i+1].posy,curvepoint[i].posx,curvepoint[i].posy,0.3333)
  //time#=timer()
  //print("time 0-1: "+str((time#-pasttime#)*1000))
  //pasttime#=time#
  if i=0
   p0posx#=curvepoint[i].posx
   p0posy#=curvepoint[i].posy
  else
   tempx#=pointonlinex(curvepoint[i].posx,curvepoint[i].posy,curvepoint[i-1].posx,curvepoint[i-1].posy,0.3333)
   tempy#=pointonliney(curvepoint[i].posx,curvepoint[i].posy,curvepoint[i-1].posx,curvepoint[i-1].posy,0.3333)
   p0posx#=pointonlinex(tempx#,tempy#,p1posx#,p1posy#,0.5)
   p0posy#=pointonliney(tempx#,tempy#,p1posx#,p1posy#,0.5)
  endif
  //time#=timer()
  //print("time 1-2: "+str((time#-pasttime#)*1000))
  //pasttime#=time#
  if i=curvepointcount-2
   p3posx#=curvepoint[i+1].posx
   p3posy#=curvepoint[i+1].posy
  else
   tempx#=pointonlinex(curvepoint[i+1].posx,curvepoint[i+1].posy,curvepoint[i+2].posx,curvepoint[i+2].posy,0.3333)
   tempy#=pointonliney(curvepoint[i+1].posx,curvepoint[i+1].posy,curvepoint[i+2].posx,curvepoint[i+2].posy,0.3333)
   p3posx#=pointonlinex(p2posx#,p2posy#,tempx#,tempy#,0.5)
   p3posy#=pointonliney(p2posx#,p2posy#,tempx#,tempy#,0.5)
  endif
  //time#=timer()
  //print("time 2-3: "+str((time#-pasttime#)*1000))
  //pasttime#=time#
  //begin calculations (conveniently adapted from http://devmag.org.za/2011/04/05/bzier-curves-a-tutorial/):
  u#=1-realt#
  tt#=realt#*realt#
  uu#=u#*u#
  uuu#=uu#*u#
  ttt#=tt#*realt#
  lastcurvepointx#=uuu#*p0posx# //first term
  lastcurvepointy#=uuu#*p0posy# //first term
  lastcurvepointx#=lastcurvepointx#+3*uu#*realt#*p1posx# //second term
  lastcurvepointy#=lastcurvepointy#+3*uu#*realt#*p1posy# //second term
  lastcurvepointx#=lastcurvepointx#+3*u#*tt#*p2posx# //third term
  lastcurvepointy#=lastcurvepointy#+3*u#*tt#*p2posy# //third term
  lastcurvepointx#=lastcurvepointx#+ttt#*p3posx# //fourth term
  lastcurvepointy#=lastcurvepointy#+ttt#*p3posy# //fourth term
  //time#=timer()
  //print("time 3-4: "+str((time#-pasttime#)*1000))
  //pasttime#=time#
  //print("end timing")
  //sync()
  //waitkey()
 else
  if curvepointcount>0
   lastcurvepointx#=curvepoint[0].posx
   lastcurvepointy#=curvepoint[0].posy
  else
   message("Tried to calculate a curve with no points! You douchebag!")
   end
  endif
 endif
endfunction

function calculateclosestpointtocurve(x#,y#) //x# and y# are the point from which we're searching
 closestdistance#=1000000 //hack, but basically could never be larger than this anyway
 if curvepointcount>0
  closestpointx#=0
  closestpointy#=0
  add#=1.0/distanceiterations
  t#=0
  for d=0 to distanceiterations-1
   calculatepointoncurve(t#)
   //distance#=ufp_distance2(x#,y#,lastcurvepointx#,lastcurvepointy#)
   distance#=sqrt((x#-lastcurvepointx#)*(x#-lastcurvepointx#)+(y#-lastcurvepointy#)*(y#-lastcurvepointy#))
   if distance#<closestdistance#
    closestdistance#=distance#
    closestpointx#=lastcurvepointx#
    closestpointy#=lastcurvepointy#
   endif
   t#=t#+add#
  next d
 endif
endfunction

function pointonlinex(x1#,y1#,x2#,y2#,percent#)
 px#=x1#+((x2#-x1#)*percent#)
endfunction px#

function pointonliney(x1#,y1#,x2#,y2#,percent#)
 py#=y1#+((y2#-y1#)*percent#)
endfunction py#

+ Code Snippet

function calculatepointoncurve(t#) //t# is the percentage of the way along the line in a range of 0-1
 if curvepointcount>1
  //print("start timing")
  //pasttime#=timer()
  totalt#=t#*(curvepointcount-1)
  i=trunc(totalt#)
  realt#=totalt#-i
  p1posx#=pointonlinex(curvepoint[i].posx,curvepoint[i].posy,curvepoint[i+1].posx,curvepoint[i+1].posy,0.3333)
  p1posy#=pointonliney(curvepoint[i].posx,curvepoint[i].posy,curvepoint[i+1].posx,curvepoint[i+1].posy,0.3333)
  p2posx#=pointonlinex(curvepoint[i+1].posx,curvepoint[i+1].posy,curvepoint[i].posx,curvepoint[i].posy,0.3333)
  p2posy#=pointonliney(curvepoint[i+1].posx,curvepoint[i+1].posy,curvepoint[i].posx,curvepoint[i].posy,0.3333)
  //time#=timer()
  //print("time 0-1: "+str((time#-pasttime#)*1000))
  //pasttime#=time#
  if i=0
   p0posx#=curvepoint[i].posx
   p0posy#=curvepoint[i].posy
  else
   tempx#=pointonlinex(curvepoint[i].posx,curvepoint[i].posy,curvepoint[i-1].posx,curvepoint[i-1].posy,0.3333)
   tempy#=pointonliney(curvepoint[i].posx,curvepoint[i].posy,curvepoint[i-1].posx,curvepoint[i-1].posy,0.3333)
   p0posx#=pointonlinex(tempx#,tempy#,p1posx#,p1posy#,0.5)
   p0posy#=pointonliney(tempx#,tempy#,p1posx#,p1posy#,0.5)
  endif
  //time#=timer()
  //print("time 1-2: "+str((time#-pasttime#)*1000))
  //pasttime#=time#
  if i=curvepointcount-2
   p3posx#=curvepoint[i+1].posx
   p3posy#=curvepoint[i+1].posy
  else
   tempx#=pointonlinex(curvepoint[i+1].posx,curvepoint[i+1].posy,curvepoint[i+2].posx,curvepoint[i+2].posy,0.3333)
   tempy#=pointonliney(curvepoint[i+1].posx,curvepoint[i+1].posy,curvepoint[i+2].posx,curvepoint[i+2].posy,0.3333)
   p3posx#=pointonlinex(p2posx#,p2posy#,tempx#,tempy#,0.5)
   p3posy#=pointonliney(p2posx#,p2posy#,tempx#,tempy#,0.5)
  endif
  //time#=timer()
  //print("time 2-3: "+str((time#-pasttime#)*1000))
  //pasttime#=time#
  //begin calculations (conveniently adapted from http://devmag.org.za/2011/04/05/bzier-curves-a-tutorial/):
  u#=1-realt#
  tt#=realt#*realt#
  uu#=u#*u#
  uuu#=uu#*u#
  ttt#=tt#*realt#
  lastcurvepointx#=uuu#*p0posx# //first term
  lastcurvepointy#=uuu#*p0posy# //first term
  lastcurvepointx#=lastcurvepointx#+3*uu#*realt#*p1posx# //second term
  lastcurvepointy#=lastcurvepointy#+3*uu#*realt#*p1posy# //second term
  lastcurvepointx#=lastcurvepointx#+3*u#*tt#*p2posx# //third term
  lastcurvepointy#=lastcurvepointy#+3*u#*tt#*p2posy# //third term
  lastcurvepointx#=lastcurvepointx#+ttt#*p3posx# //fourth term
  lastcurvepointy#=lastcurvepointy#+ttt#*p3posy# //fourth term
  //time#=timer()
  //print("time 3-4: "+str((time#-pasttime#)*1000))
  //pasttime#=time#
  //print("end timing")
  //sync()
  //waitkey()
 else
  if curvepointcount>0
   lastcurvepointx#=curvepoint[0].posx
   lastcurvepointy#=curvepoint[0].posy
  else
   message("Tried to calculate a curve with no points! You douchebag!")
   end
  endif
 endif
endfunction

function calculateclosestpointtocurve(x#,y#) //x# and y# are the point from which we're searching
 closestdistance#=1000000 //hack, but basically could never be larger than this anyway
 if curvepointcount>0
  closestpointx#=0
  closestpointy#=0
  add#=1.0/distanceiterations
  t#=0
  for d=0 to distanceiterations-1
   calculatepointoncurve(t#)
   //distance#=ufp_distance2(x#,y#,lastcurvepointx#,lastcurvepointy#)
   distance#=sqrt((x#-lastcurvepointx#)*(x#-lastcurvepointx#)+(y#-lastcurvepointy#)*(y#-lastcurvepointy#))
   if distance#<closestdistance#
    closestdistance#=distance#
    closestpointx#=lastcurvepointx#
    closestpointy#=lastcurvepointy#
   endif
   t#=t#+add#
  next d
 endif
endfunction

function pointonlinex(x1#,y1#,x2#,y2#,percent#)
 px#=x1#+((x2#-x1#)*percent#)
endfunction px#

function pointonliney(x1#,y1#,x2#,y2#,percent#)
 py#=y1#+((y2#-y1#)*percent#)
endfunction py#

Placement Editor Professional
Code Line Counter

Back to top

Profile PM Email

Clonkex

Forum Vice President

14

Years of Service

User Offline

Joined: 20th May 2010

Location: Northern Tablelands, NSW, Australia

Posted: 20th Mar 2014 12:08

Link

Update: Here's the latest (and probably final, as it seems exactly as I need it now) version. Now included is a way to precompute the "closest point" points for extra speediness.

What I've also done is separate the bezier curve code from my project code and make it a library (much easier to use). You can get it here, now living in its very own thread: http://forum.thegamecreators.com/?m=forum_view&t=210460&b=41&p=0

Placement Editor Professional
Code Line Counter

Back to top

Profile PM Email

Sorry your browser is not supported!

AppGameKit Classic Chat / [T1] "Automatic" Bezier Path Generation?

Attachments

Sorry your browser is not supported!

AppGameKit Classic Chat / [T1] &quot;Automatic&quot; Bezier Path Generation?

Attachments

AppGameKit Classic Chat / [T1] "Automatic" Bezier Path Generation?