Moving fractal tree in DBPro - GameCreators Forum

Author

Message

HowDo

22

Years of Service

User Offline

Joined: 28th Nov 2002

Location: United Kingdom

Posted: 8th Apr 2006 22:46 Edited at: 9th Apr 2006 14:54

Link

Hi all

Found this code for qbasic and have modfiy it to work in DBPro takes about 2000 conts before it starts to look bent.

Rem Project: mandeltrees
Rem Created: 08/04/2006 10:31:47

Rem ***** Main Source File *****
REM Initialization
`SCREEN 12
set display mode 1024,768,16
randomize timer()
S = 10
`WINDOW (-S, -S)-(S, S)
REM NIter is the number of iterations
sync off
sync rate 0
NIter = 12
TPoints = 2 ^ NIter
Length# = S / 2
Stp = TPoints / 4
K# = 1 / SQRt(2)

REM a(x, y)holds the coordinates of every branch tip
DIM a(TPoints, 2) as float

REM Calculate plain tree
FOR i = 1 TO NIter - 1
  FOR x = Stp TO TPoints STEP Stp * 4
    IF i MOD 2 = 0
      a(x, 0) = a(x + Stp, 0)
      a(x + 2 * Stp, 0) = a(x + Stp, 0)
      a(x, 1) = a(x + Stp, 1) - Length#
      a(x + 2 * Stp, 1) = a(x + Stp, 1) + Length#
    ELSE
      a(x, 0) = a(x + Stp, 0) - Length#
      a(x + 2 * Stp, 0) = a(x + Stp, 0) + Length#
      a(x, 1) = a(x + Stp, 1)
      a(x + 2 * Stp, 1) = a(x + Stp, 1)
    ENDIF
  NEXT x
  Stp = Stp / 2
  Length# = Length# * K#
NEXT i

do
CLS
REM Leave the program when pressing any key

text 0,0,str$(t)+ " fps="+str$(screen fps())
rem +" alfa#="+str$(Alfa#)+"  rn="+str$(rn)+"   alpha2="+str$( RND(8)* St#)+"  st#="+str$(st#)
IF INKEY$() <> "" THEN END
Stp = TPoints / 4
g=50
REM Draw tree
FOR i = 1 TO NIter - 1
  FOR x = Stp TO TPoints STEP Stp * 4
    x0 = a(x, 0)*g
    y0 = a(x, 1)*g
    P2 = 2 * Stp
    x1 = a(x + P2, 0)*g
    y1 = a(x + P2, 1)*g
    LINE (screen width()/2)-x0, (screen height()/2)-y0,(screen width()/2)-x1,(screen height()/2)-y1

NEXT x
  Stp = Stp / 2
NEXT i
sync
Stp = TPoints / 4
Pi# = 3.14159
St# = Pi# / 128.0

REM Rotate Tree Randomly
FOR i = 1 TO NIter - 1
  Counter = 0
  FOR x = Stp TO TPoints - 1 STEP Stp * 2
    P2 = 2 * Stp
    Counter = Counter + 1
    Ax# = a(x, 0)
    Ay# = a(x, 1)
    Az# = a(x, 2)
    IF Counter MOD 2 = 1
      Bx# = a(x + P2, 0)
      By# = a(x + P2, 1)
      Bz# = a(x + P2, 2)
    ELSE
      Bx# = a(x - P2, 0)
      By# = a(x - P2, 1)
      Bz# = a(x - P2, 2)
    ENDIF
    Mn# = SQRt((Bx# - Ax#) ^ 2 + (By# - Ay#) ^ 2 + (Bz# - Az#) ^ 2)
    nx# = (Bx# - Ax#) / Mn#
    ny# = (By# - Ay#) / Mn#
    nz# = (Bz# - Az#) / Mn#

Alfa# = RND(8)* St#
    rn=rnd(10)

if rn>5
     Alfa# = -Alfa#
endif
if rn<10
alfa#=alfa#
endif

ca# = COS(Alfa#)
    sa# = SIN(Alfa#)

FOR j = x - Stp + 1 TO x + Stp - 1
      Px# = a(j, 0) - Ax#
      Py# = a(j, 1) - Ay#
      Pz# = a(j, 2) - Az#
      nPEscalar# = nx# * Px# + ny# * Py# + nz# * Pz#
      nnPx# = nPEscalar# * nx#
      nnPy# = nPEscalar# * ny#
      nnPz# = nPEscalar# * nz#
      cx# = ca# * (Px# - nnPx#)
      cy# = ca# * (Py# - nnPy#)
      cz# = ca# * (Pz# - nnPz#)

snxPx# = sa# * (ny# * Pz# - nz# * Py#)
      snxPy# = sa# * (nz# * Px# - nx# * Pz#)
      snxPz# = sa# * (nx# * Py# - ny# * Px#)

a(j, 0) = nnPx# + cx# + snxPx# + Ax#
      a(j, 1) = nnPy# + cy# + snxPy# + Ay#
      a(j, 2) = nnPz# + cz# + snxPz# + Az#
    NEXT j
  NEXT x
  Stp = Stp / 2
NEXT i
`sync
inc t
loop
remstart

REM Initialization
SCREEN 12
S = 10
WINDOW (-S, -S)-(S, S)
REM NIter is the number of iterations
NIter = 12
TPoints = 2 ^ NIter
Length = S / 2
Stp = TPoints / 4
K = 1 / SQR(2)
REM a(x, y)holds the coordinates of every branch tip
DIM a(TPoints, 2)

REM Calculate plain tree
FOR i = 1 TO NIter - 1
  FOR x = Stp TO TPoints STEP Stp * 4
    IF i MOD 2 = 0 THEN
      a(x, 0) = a(x + Stp, 0)
      a(x + 2 * Stp, 0) = a(x + Stp, 0)
      a(x, 1) = a(x + Stp, 1) - Length
      a(x + 2 * Stp, 1) = a(x + Stp, 1) + Length
    ELSE
      a(x, 0) = a(x + Stp, 0) - Length
      a(x + 2 * Stp, 0) = a(x + Stp, 0) + Length
      a(x, 1) = a(x + Stp, 1)
      a(x + 2 * Stp, 1) = a(x + Stp, 1)
    END IF
  NEXT x
  Stp = Stp / 2
  Length = Length * K
NEXT i

di:
CLS
REM Leave the program when pressing any key
IF INKEY$ <> "" THEN END
Stp = TPoints / 4

REM Draw tree
FOR i = 1 TO NIter - 1
  FOR x = Stp TO TPoints STEP Stp * 4
    x0 = a(x, 0)
    y0 = a(x, 1)
    P2 = 2 * Stp
    x1 = a(x + P2, 0)
    y1 = a(x + P2, 1)
    LINE (x0, y0)-(x1, y1)
  NEXT x
  Stp = Stp / 2
NEXT i

Stp = TPoints / 4
Pi = 3.14159
St = Pi / 128

REM Rotate Tree Randomly
FOR i = 1 TO NIter - 1
  Counter = 0
  FOR x = Stp TO TPoints - 1 STEP Stp * 2
    P2 = 2 * Stp
    Counter = Counter + 1
    Ax = a(x, 0)
    Ay = a(x, 1)
    Az = a(x, 2)
    IF Counter MOD 2 = 1 THEN
      Bx = a(x + P2, 0)
      By = a(x + P2, 1)
      Bz = a(x + P2, 2)
    ELSE
      Bx = a(x - P2, 0)
      By = a(x - P2, 1)
      Bz = a(x - P2, 2)
    END IF
    Mn = SQR((Bx - Ax) ^ 2 + (By - Ay) ^ 2 + (Bz - Az) ^ 2)
    nx = (Bx - Ax) / Mn
    ny = (By - Ay) / Mn
    nz = (Bz - Az) / Mn

Alfa = INT(RND * 8) * St
    IF RND > .5 THEN Alfa = -Alfa
    ca = COS(Alfa)
    sa = SIN(Alfa)

FOR j = x - Stp + 1 TO x + Stp - 1
      Px = a(j, 0) - Ax
      Py = a(j, 1) - Ay
      Pz = a(j, 2) - Az
      nPEscalar = nx * Px + ny * Py + nz * Pz
      nnPx = nPEscalar * nx
      nnPy = nPEscalar * ny
      nnPz = nPEscalar * nz
      cx = ca * (Px - nnPx)
      cy = ca * (Py - nnPy)
      cz = ca * (Pz - nnPz)

snxPx = sa * (ny * Pz - nz * Py)
      snxPy = sa * (nz * Px - nx * Pz)
      snxPz = sa * (nx * Py - ny * Px)

a(j, 0) = nnPx + cx + snxPx + Ax
      a(j, 1) = nnPy + cy + snxPy + Ay
      a(j, 2) = nnPz + cz + snxPz + Az
    NEXT j
  NEXT x
  Stp = Stp / 2
NEXT i

GOTO di

remend

+ Code Snippet

Rem Project: mandeltrees
Rem Created: 08/04/2006 10:31:47

Rem ***** Main Source File *****
REM Initialization
`SCREEN 12
set display mode 1024,768,16
randomize timer()
S = 10
`WINDOW (-S, -S)-(S, S)
REM NIter is the number of iterations
sync off
sync rate 0
NIter = 12
TPoints = 2 ^ NIter
Length# = S / 2
Stp = TPoints / 4
K# = 1 / SQRt(2)

REM a(x, y)holds the coordinates of every branch tip
DIM a(TPoints, 2) as float

REM Calculate plain tree
FOR i = 1 TO NIter - 1
  FOR x = Stp TO TPoints STEP Stp * 4
    IF i MOD 2 = 0
      a(x, 0) = a(x + Stp, 0)
      a(x + 2 * Stp, 0) = a(x + Stp, 0)
      a(x, 1) = a(x + Stp, 1) - Length#
      a(x + 2 * Stp, 1) = a(x + Stp, 1) + Length#
    ELSE
      a(x, 0) = a(x + Stp, 0) - Length#
      a(x + 2 * Stp, 0) = a(x + Stp, 0) + Length#
      a(x, 1) = a(x + Stp, 1)
      a(x + 2 * Stp, 1) = a(x + Stp, 1)
    ENDIF
  NEXT x
  Stp = Stp / 2
  Length# = Length# * K#
NEXT i

do
CLS
REM Leave the program when pressing any key

text 0,0,str$(t)+ " fps="+str$(screen fps())
rem +" alfa#="+str$(Alfa#)+"  rn="+str$(rn)+"   alpha2="+str$( RND(8)* St#)+"  st#="+str$(st#)
IF INKEY$() <> "" THEN END
Stp = TPoints / 4
g=50
REM Draw tree
FOR i = 1 TO NIter - 1
  FOR x = Stp TO TPoints STEP Stp * 4
    x0 = a(x, 0)*g
    y0 = a(x, 1)*g
    P2 = 2 * Stp
    x1 = a(x + P2, 0)*g
    y1 = a(x + P2, 1)*g
    LINE (screen width()/2)-x0, (screen height()/2)-y0,(screen width()/2)-x1,(screen height()/2)-y1

  NEXT x
  Stp = Stp / 2
NEXT i
sync
Stp = TPoints / 4
Pi# = 3.14159
St# = Pi# / 128.0

REM Rotate Tree Randomly
FOR i = 1 TO NIter - 1
  Counter = 0
  FOR x = Stp TO TPoints - 1 STEP Stp * 2
    P2 = 2 * Stp
    Counter = Counter + 1
    Ax# = a(x, 0)
    Ay# = a(x, 1)
    Az# = a(x, 2)
    IF Counter MOD 2 = 1
      Bx# = a(x + P2, 0)
      By# = a(x + P2, 1)
      Bz# = a(x + P2, 2)
    ELSE
      Bx# = a(x - P2, 0)
      By# = a(x - P2, 1)
      Bz# = a(x - P2, 2)
    ENDIF
    Mn# = SQRt((Bx# - Ax#) ^ 2 + (By# - Ay#) ^ 2 + (Bz# - Az#) ^ 2)
    nx# = (Bx# - Ax#) / Mn#
    ny# = (By# - Ay#) / Mn#
    nz# = (Bz# - Az#) / Mn#

    Alfa# = RND(8)* St#
    rn=rnd(10)

    if rn>5
     Alfa# = -Alfa#
endif
if rn<10
alfa#=alfa#
endif

    ca# = COS(Alfa#)
    sa# = SIN(Alfa#)

    FOR j = x - Stp + 1 TO x + Stp - 1
      Px# = a(j, 0) - Ax#
      Py# = a(j, 1) - Ay#
      Pz# = a(j, 2) - Az#
      nPEscalar# = nx# * Px# + ny# * Py# + nz# * Pz#
      nnPx# = nPEscalar# * nx#
      nnPy# = nPEscalar# * ny#
      nnPz# = nPEscalar# * nz#
      cx# = ca# * (Px# - nnPx#)
      cy# = ca# * (Py# - nnPy#)
      cz# = ca# * (Pz# - nnPz#)

      snxPx# = sa# * (ny# * Pz# - nz# * Py#)
      snxPy# = sa# * (nz# * Px# - nx# * Pz#)
      snxPz# = sa# * (nx# * Py# - ny# * Px#)

      a(j, 0) = nnPx# + cx# + snxPx# + Ax#
      a(j, 1) = nnPy# + cy# + snxPy# + Ay#
      a(j, 2) = nnPz# + cz# + snxPz# + Az#
    NEXT j
  NEXT x
  Stp = Stp / 2
NEXT i
`sync
inc t
loop
remstart

REM Initialization
SCREEN 12
S = 10
WINDOW (-S, -S)-(S, S)
REM NIter is the number of iterations
NIter = 12
TPoints = 2 ^ NIter
Length = S / 2
Stp = TPoints / 4
K = 1 / SQR(2)
REM a(x, y)holds the coordinates of every branch tip
DIM a(TPoints, 2)

REM Calculate plain tree
FOR i = 1 TO NIter - 1
  FOR x = Stp TO TPoints STEP Stp * 4
    IF i MOD 2 = 0 THEN
      a(x, 0) = a(x + Stp, 0)
      a(x + 2 * Stp, 0) = a(x + Stp, 0)
      a(x, 1) = a(x + Stp, 1) - Length
      a(x + 2 * Stp, 1) = a(x + Stp, 1) + Length
    ELSE
      a(x, 0) = a(x + Stp, 0) - Length
      a(x + 2 * Stp, 0) = a(x + Stp, 0) + Length
      a(x, 1) = a(x + Stp, 1)
      a(x + 2 * Stp, 1) = a(x + Stp, 1)
    END IF
  NEXT x
  Stp = Stp / 2
  Length = Length * K
NEXT i

di:
CLS
REM Leave the program when pressing any key
IF INKEY$ <> "" THEN END
Stp = TPoints / 4

REM Draw tree
FOR i = 1 TO NIter - 1
  FOR x = Stp TO TPoints STEP Stp * 4
    x0 = a(x, 0)
    y0 = a(x, 1)
    P2 = 2 * Stp
    x1 = a(x + P2, 0)
    y1 = a(x + P2, 1)
    LINE (x0, y0)-(x1, y1)
  NEXT x
  Stp = Stp / 2
NEXT i

Stp = TPoints / 4
Pi = 3.14159
St = Pi / 128

REM Rotate Tree Randomly
FOR i = 1 TO NIter - 1
  Counter = 0
  FOR x = Stp TO TPoints - 1 STEP Stp * 2
    P2 = 2 * Stp
    Counter = Counter + 1
    Ax = a(x, 0)
    Ay = a(x, 1)
    Az = a(x, 2)
    IF Counter MOD 2 = 1 THEN
      Bx = a(x + P2, 0)
      By = a(x + P2, 1)
      Bz = a(x + P2, 2)
    ELSE
      Bx = a(x - P2, 0)
      By = a(x - P2, 1)
      Bz = a(x - P2, 2)
    END IF
    Mn = SQR((Bx - Ax) ^ 2 + (By - Ay) ^ 2 + (Bz - Az) ^ 2)
    nx = (Bx - Ax) / Mn
    ny = (By - Ay) / Mn
    nz = (Bz - Az) / Mn

    Alfa = INT(RND * 8) * St
    IF RND > .5 THEN Alfa = -Alfa
    ca = COS(Alfa)
    sa = SIN(Alfa)

    FOR j = x - Stp + 1 TO x + Stp - 1
      Px = a(j, 0) - Ax
      Py = a(j, 1) - Ay
      Pz = a(j, 2) - Az
      nPEscalar = nx * Px + ny * Py + nz * Pz
      nnPx = nPEscalar * nx
      nnPy = nPEscalar * ny
      nnPz = nPEscalar * nz
      cx = ca * (Px - nnPx)
      cy = ca * (Py - nnPy)
      cz = ca * (Pz - nnPz)

      snxPx = sa * (ny * Pz - nz * Py)
      snxPy = sa * (nz * Px - nx * Pz)
      snxPz = sa * (nx * Py - ny * Px)

      a(j, 0) = nnPx + cx + snxPx + Ax
      a(j, 1) = nnPy + cy + snxPy + Ay
      a(j, 2) = nnPz + cz + snxPz + Az
    NEXT j
  NEXT x
  Stp = Stp / 2
NEXT i

GOTO di

remend

has oragianl code in there as well.

might work in DBC.

ps. on a p3 1 ghz gets about 4 fps.

I'm not getting you down am I, Ho Look! another fancy Door?

Back to top

Profile PM

HowDo

22

Years of Service

User Offline

Joined: 28th Nov 2002

Location: United Kingdom

Posted: 10th Apr 2006 00:16

Link

An update got the rnd >.5 bit sorted now compltes abit quicker.

Rem Project: mandeltrees
Rem Created: 08/04/2006 10:31:47

Rem ***** Main Source File *****
REM Initialization
`SCREEN 12
`set display mode 1024,768,16
randomize timer()
#constant Pi = 3.14159
#constant g=25
#constant S = 10
#constant K = 1 / SQRt(2)
#constant sw = screen width()/2
#constant sh = screen height()/2

`WINDOW (-S, -S)-(S, S)
REM NIter is the number of iterations
sync off
sync rate 0
NIter = 12
TPoints = 2 ^ NIter
Length# = S / 2
Stp = TPoints / 4

REM a(x, y)holds the coordinates of every branch tip
DIM a(TPoints, 2) as float

REM Calculate plain tree
FOR i = 1 TO NIter - 1
  FOR x = Stp TO TPoints STEP Stp * 4
    IF i MOD 2 = 0
      a(x, 0) = a(x + Stp, 0)
      a(x + 2 * Stp, 0) = a(x + Stp, 0)
      a(x, 1) = a(x + Stp, 1) - Length#
      a(x + 2 * Stp, 1) = a(x + Stp, 1) + Length#
    ELSE
      a(x, 0) = a(x + Stp, 0) - Length#
      a(x + 2 * Stp, 0) = a(x + Stp, 0) + Length#
      a(x, 1) = a(x + Stp, 1)
      a(x + 2 * Stp, 1) = a(x + Stp, 1)
    ENDIF
  NEXT x
  Stp = Stp / 2
  Length# = Length# * K
NEXT i

do
CLS
REM Leave the program when pressing any key

text 0,0,str$(t)+ " fps="+str$(screen fps())
rem +" alfa#="+str$(Alfa#)+"  rn="+str$(rn)+"   alpha2="+str$( RND(8)* St#)+"  st#="+str$(st#)
`IF INKEY$() <> "" THEN END
Stp = TPoints / 4

REM Draw tree
FOR i = 1 TO NIter - 1
  FOR x = Stp TO TPoints STEP Stp * 4
    x0 = a(x, 0)*g
    y0 = a(x, 1)*g
    P2 = 2 * Stp
    x1 = a(x + P2, 0)*g
    y1 = a(x + P2, 1)*g
    LINE sw-x0, sh-y0,sw-x1,sh-y1

NEXT x
  Stp = Stp / 2
NEXT i
sync
Stp = TPoints / 4

St# = Pi / 128.0

REM Rotate Tree Randomly
FOR i = 1 TO NIter - 1
  Counter = 0
  FOR x = Stp TO TPoints - 1 STEP Stp * 2
    P2 = 2 * Stp
    Counter = Counter + 1
    Ax# = a(x, 0)
    Ay# = a(x, 1)
    Az# = a(x, 2)
    IF Counter MOD 2 = 1
      Bx# = a(x + P2, 0)
      By# = a(x + P2, 1)
      Bz# = a(x + P2, 2)
    ELSE
      Bx# = a(x - P2, 0)
      By# = a(x - P2, 1)
      Bz# = a(x - P2, 2)
    ENDIF
    Mn# = SQRt((Bx# - Ax#) ^ 2 + (By# - Ay#) ^ 2 + (Bz# - Az#) ^ 2)
    nx# = (Bx# - Ax#) / Mn#
    ny# = (By# - Ay#) / Mn#
    nz# = (Bz# - Az#) / Mn#

Alfa# = RND(8)* St#
    rn=rnd(10)/100

if rn> .5
     Alfa# = -Alfa#
`  else
  `    alfa#=alfa#
   endif
    ca# = COS(Alfa#)
    sa# = SIN(Alfa#)

FOR j = x - Stp + 1 TO x + Stp - 1

Px# = a(j, 0) - Ax#
      Py# = a(j, 1) - Ay#
      Pz# = a(j, 2) - Az#

nPEscalar# = nx# * Px# + ny# * Py# + nz# * Pz#

nnPx# = nPEscalar# * nx#
      nnPy# = nPEscalar# * ny#
      nnPz# = nPEscalar# * nz#

cx# = ca# * (Px# - nnPx#)
      cy# = ca# * (Py# - nnPy#)
      cz# = ca# * (Pz# - nnPz#)

snxPx# = sa# * (ny# * Pz# - nz# * Py#)
      snxPy# = sa# * (nz# * Px# - nx# * Pz#)
      snxPz# = sa# * (nx# * Py# - ny# * Px#)

a(j, 0) = nnPx# + cx# + snxPx# + Ax#
      a(j, 1) = nnPy# + cy# + snxPy# + Ay#
      a(j, 2) = nnPz# + cz# + snxPz# + Az#
    NEXT j
  NEXT x
  Stp = Stp / 2
NEXT i
`sync
inc t
loop
remstart

REM Initialization
SCREEN 12
S = 10
WINDOW (-S, -S)-(S, S)
REM NIter is the number of iterations
NIter = 12
TPoints = 2 ^ NIter
Length = S / 2
Stp = TPoints / 4
K = 1 / SQR(2)
REM a(x, y)holds the coordinates of every branch tip
DIM a(TPoints, 2)

REM Calculate plain tree
FOR i = 1 TO NIter - 1
  FOR x = Stp TO TPoints STEP Stp * 4
    IF i MOD 2 = 0 THEN
      a(x, 0) = a(x + Stp, 0)
      a(x + 2 * Stp, 0) = a(x + Stp, 0)
      a(x, 1) = a(x + Stp, 1) - Length
      a(x + 2 * Stp, 1) = a(x + Stp, 1) + Length
    ELSE
      a(x, 0) = a(x + Stp, 0) - Length
      a(x + 2 * Stp, 0) = a(x + Stp, 0) + Length
      a(x, 1) = a(x + Stp, 1)
      a(x + 2 * Stp, 1) = a(x + Stp, 1)
    END IF
  NEXT x
  Stp = Stp / 2
  Length = Length * K
NEXT i

di:
CLS
REM Leave the program when pressing any key
IF INKEY$ <> "" THEN END
Stp = TPoints / 4

REM Draw tree
FOR i = 1 TO NIter - 1
  FOR x = Stp TO TPoints STEP Stp * 4
    x0 = a(x, 0)
    y0 = a(x, 1)
    P2 = 2 * Stp
    x1 = a(x + P2, 0)
    y1 = a(x + P2, 1)
    LINE (x0, y0)-(x1, y1)
  NEXT x
  Stp = Stp / 2
NEXT i

Stp = TPoints / 4
Pi = 3.14159
St = Pi / 128

REM Rotate Tree Randomly
FOR i = 1 TO NIter - 1
  Counter = 0
  FOR x = Stp TO TPoints - 1 STEP Stp * 2
    P2 = 2 * Stp
    Counter = Counter + 1
    Ax = a(x, 0)
    Ay = a(x, 1)
    Az = a(x, 2)
    IF Counter MOD 2 = 1 THEN
      Bx = a(x + P2, 0)
      By = a(x + P2, 1)
      Bz = a(x + P2, 2)
    ELSE
      Bx = a(x - P2, 0)
      By = a(x - P2, 1)
      Bz = a(x - P2, 2)
    END IF
    Mn = SQR((Bx - Ax) ^ 2 + (By - Ay) ^ 2 + (Bz - Az) ^ 2)
    nx = (Bx - Ax) / Mn
    ny = (By - Ay) / Mn
    nz = (Bz - Az) / Mn

Alfa = INT(RND * 8) * St
    IF RND > .5 THEN Alfa = -Alfa
    ca = COS(Alfa)
    sa = SIN(Alfa)

FOR j = x - Stp + 1 TO x + Stp - 1
      Px = a(j, 0) - Ax
      Py = a(j, 1) - Ay
      Pz = a(j, 2) - Az
      nPEscalar = nx * Px + ny * Py + nz * Pz
      nnPx = nPEscalar * nx
      nnPy = nPEscalar * ny
      nnPz = nPEscalar * nz
      cx = ca * (Px - nnPx)
      cy = ca * (Py - nnPy)
      cz = ca * (Pz - nnPz)

snxPx = sa * (ny * Pz - nz * Py)
      snxPy = sa * (nz * Px - nx * Pz)
      snxPz = sa * (nx * Py - ny * Px)

a(j, 0) = nnPx + cx + snxPx + Ax
      a(j, 1) = nnPy + cy + snxPy + Ay
      a(j, 2) = nnPz + cz + snxPz + Az
    NEXT j
  NEXT x
  Stp = Stp / 2
NEXT i

GOTO di

remend

+ Code Snippet

Rem Project: mandeltrees
Rem Created: 08/04/2006 10:31:47

Rem ***** Main Source File *****
REM Initialization
`SCREEN 12
`set display mode 1024,768,16
randomize timer()
#constant Pi = 3.14159
#constant g=25
#constant S = 10
#constant K = 1 / SQRt(2)
#constant sw = screen width()/2
#constant sh = screen height()/2

`WINDOW (-S, -S)-(S, S)
REM NIter is the number of iterations
sync off
sync rate 0
NIter = 12
TPoints = 2 ^ NIter
Length# = S / 2
Stp = TPoints / 4


REM a(x, y)holds the coordinates of every branch tip
DIM a(TPoints, 2) as float

REM Calculate plain tree
FOR i = 1 TO NIter - 1
  FOR x = Stp TO TPoints STEP Stp * 4
    IF i MOD 2 = 0
      a(x, 0) = a(x + Stp, 0)
      a(x + 2 * Stp, 0) = a(x + Stp, 0)
      a(x, 1) = a(x + Stp, 1) - Length#
      a(x + 2 * Stp, 1) = a(x + Stp, 1) + Length#
    ELSE
      a(x, 0) = a(x + Stp, 0) - Length#
      a(x + 2 * Stp, 0) = a(x + Stp, 0) + Length#
      a(x, 1) = a(x + Stp, 1)
      a(x + 2 * Stp, 1) = a(x + Stp, 1)
    ENDIF
  NEXT x
  Stp = Stp / 2
  Length# = Length# * K
NEXT i

do
CLS
REM Leave the program when pressing any key

text 0,0,str$(t)+ " fps="+str$(screen fps())
rem +" alfa#="+str$(Alfa#)+"  rn="+str$(rn)+"   alpha2="+str$( RND(8)* St#)+"  st#="+str$(st#)
`IF INKEY$() <> "" THEN END
Stp = TPoints / 4

REM Draw tree
FOR i = 1 TO NIter - 1
  FOR x = Stp TO TPoints STEP Stp * 4
    x0 = a(x, 0)*g
    y0 = a(x, 1)*g
    P2 = 2 * Stp
    x1 = a(x + P2, 0)*g
    y1 = a(x + P2, 1)*g
    LINE sw-x0, sh-y0,sw-x1,sh-y1

  NEXT x
  Stp = Stp / 2
NEXT i
sync
Stp = TPoints / 4

St# = Pi / 128.0

REM Rotate Tree Randomly
FOR i = 1 TO NIter - 1
  Counter = 0
  FOR x = Stp TO TPoints - 1 STEP Stp * 2
    P2 = 2 * Stp
    Counter = Counter + 1
    Ax# = a(x, 0)
    Ay# = a(x, 1)
    Az# = a(x, 2)
    IF Counter MOD 2 = 1
      Bx# = a(x + P2, 0)
      By# = a(x + P2, 1)
      Bz# = a(x + P2, 2)
    ELSE
      Bx# = a(x - P2, 0)
      By# = a(x - P2, 1)
      Bz# = a(x - P2, 2)
    ENDIF
    Mn# = SQRt((Bx# - Ax#) ^ 2 + (By# - Ay#) ^ 2 + (Bz# - Az#) ^ 2)
    nx# = (Bx# - Ax#) / Mn#
    ny# = (By# - Ay#) / Mn#
    nz# = (Bz# - Az#) / Mn#

    Alfa# = RND(8)* St#
    rn=rnd(10)/100

    if rn> .5
     Alfa# = -Alfa#
`  else
  `    alfa#=alfa#
   endif
    ca# = COS(Alfa#)
    sa# = SIN(Alfa#)

    FOR j = x - Stp + 1 TO x + Stp - 1

      Px# = a(j, 0) - Ax#
      Py# = a(j, 1) - Ay#
      Pz# = a(j, 2) - Az#

      nPEscalar# = nx# * Px# + ny# * Py# + nz# * Pz#

      nnPx# = nPEscalar# * nx#
      nnPy# = nPEscalar# * ny#
      nnPz# = nPEscalar# * nz#

      cx# = ca# * (Px# - nnPx#)
      cy# = ca# * (Py# - nnPy#)
      cz# = ca# * (Pz# - nnPz#)

      snxPx# = sa# * (ny# * Pz# - nz# * Py#)
      snxPy# = sa# * (nz# * Px# - nx# * Pz#)
      snxPz# = sa# * (nx# * Py# - ny# * Px#)

      a(j, 0) = nnPx# + cx# + snxPx# + Ax#
      a(j, 1) = nnPy# + cy# + snxPy# + Ay#
      a(j, 2) = nnPz# + cz# + snxPz# + Az#
    NEXT j
  NEXT x
  Stp = Stp / 2
NEXT i
`sync
inc t
loop
remstart

REM Initialization
SCREEN 12
S = 10
WINDOW (-S, -S)-(S, S)
REM NIter is the number of iterations
NIter = 12
TPoints = 2 ^ NIter
Length = S / 2
Stp = TPoints / 4
K = 1 / SQR(2)
REM a(x, y)holds the coordinates of every branch tip
DIM a(TPoints, 2)

REM Calculate plain tree
FOR i = 1 TO NIter - 1
  FOR x = Stp TO TPoints STEP Stp * 4
    IF i MOD 2 = 0 THEN
      a(x, 0) = a(x + Stp, 0)
      a(x + 2 * Stp, 0) = a(x + Stp, 0)
      a(x, 1) = a(x + Stp, 1) - Length
      a(x + 2 * Stp, 1) = a(x + Stp, 1) + Length
    ELSE
      a(x, 0) = a(x + Stp, 0) - Length
      a(x + 2 * Stp, 0) = a(x + Stp, 0) + Length
      a(x, 1) = a(x + Stp, 1)
      a(x + 2 * Stp, 1) = a(x + Stp, 1)
    END IF
  NEXT x
  Stp = Stp / 2
  Length = Length * K
NEXT i

di:
CLS
REM Leave the program when pressing any key
IF INKEY$ <> "" THEN END
Stp = TPoints / 4

REM Draw tree
FOR i = 1 TO NIter - 1
  FOR x = Stp TO TPoints STEP Stp * 4
    x0 = a(x, 0)
    y0 = a(x, 1)
    P2 = 2 * Stp
    x1 = a(x + P2, 0)
    y1 = a(x + P2, 1)
    LINE (x0, y0)-(x1, y1)
  NEXT x
  Stp = Stp / 2
NEXT i

Stp = TPoints / 4
Pi = 3.14159
St = Pi / 128

REM Rotate Tree Randomly
FOR i = 1 TO NIter - 1
  Counter = 0
  FOR x = Stp TO TPoints - 1 STEP Stp * 2
    P2 = 2 * Stp
    Counter = Counter + 1
    Ax = a(x, 0)
    Ay = a(x, 1)
    Az = a(x, 2)
    IF Counter MOD 2 = 1 THEN
      Bx = a(x + P2, 0)
      By = a(x + P2, 1)
      Bz = a(x + P2, 2)
    ELSE
      Bx = a(x - P2, 0)
      By = a(x - P2, 1)
      Bz = a(x - P2, 2)
    END IF
    Mn = SQR((Bx - Ax) ^ 2 + (By - Ay) ^ 2 + (Bz - Az) ^ 2)
    nx = (Bx - Ax) / Mn
    ny = (By - Ay) / Mn
    nz = (Bz - Az) / Mn

    Alfa = INT(RND * 8) * St
    IF RND > .5 THEN Alfa = -Alfa
    ca = COS(Alfa)
    sa = SIN(Alfa)

    FOR j = x - Stp + 1 TO x + Stp - 1
      Px = a(j, 0) - Ax
      Py = a(j, 1) - Ay
      Pz = a(j, 2) - Az
      nPEscalar = nx * Px + ny * Py + nz * Pz
      nnPx = nPEscalar * nx
      nnPy = nPEscalar * ny
      nnPz = nPEscalar * nz
      cx = ca * (Px - nnPx)
      cy = ca * (Py - nnPy)
      cz = ca * (Pz - nnPz)

      snxPx = sa * (ny * Pz - nz * Py)
      snxPy = sa * (nz * Px - nx * Pz)
      snxPz = sa * (nx * Py - ny * Px)

      a(j, 0) = nnPx + cx + snxPx + Ax
      a(j, 1) = nnPy + cy + snxPy + Ay
      a(j, 2) = nnPz + cz + snxPz + Az
    NEXT j
  NEXT x
  Stp = Stp / 2
NEXT i

GOTO di

remend

I'm not getting you down am I, Ho Look! another fancy Door?

Back to top

Profile PM

Jess T

Retired Moderator

21

Years of Service

User Offline

Joined: 20th Sep 2003

Location: Over There... Kablam!

Posted: 10th Apr 2006 05:52 Edited at: 10th Apr 2006 08:28

Link

You could speed it up a bit more by using FastSync.
Also, change all drawing commands to write to a bitmap ( or directly to the backbuffer ), then paste it as a sprite.

Also, for all your math's operations, if you stick with values that are powers of 2 ( 2, 4, 8, 16... 128, etc ), then you can easily bit-shift to speed up the math operations.

for example;
St# = Pi / 128.0
becomes:
St# = Pi >> 7
( as 2^7 = 128 )

Or;
FOR x = Stp TO TPoints STEP Stp * 4
becomes:
FOR x = Stp TO TPoints STEP Stp << 2

... etc

[Edit] And another possibilty is, step it up so that it doesn't do 2000 itterations, but 200, save each stage as a seperate sprite, then play it all back once all are generated

[/Edit]
[Edit 2]
Also, sticking entirely with Integers ( or DWords ), avoiding Floats will speed things up too
[/Edit]

Team EOD :: All-Round Nice Guy
Want Better dbHelp Files?

Back to top

Profile PM Email Website

HowDo

22

Years of Service

User Offline

Joined: 28th Nov 2002

Location: United Kingdom

Posted: 10th Apr 2006 15:50 Edited at: 10th Apr 2006 16:29

Link

cheers JessTicular nice to have someone who knows there maths

and how to use it, will be giving thoses ideas ago later on.

err if I have done this right it should look like this, yes!

old
St# = Pi / 128.0
new
stt# = Pi >> 7

old = 0.245436...

new = 4.203....e 045

so is something not working or is it I do not understand use of sign yet.

P.s. Am I allowed to do this or not
#constant St = Pi / 128.0
because if so it no work.

I'm not getting you down am I, Ho Look! another fancy Door?

Back to top

Profile PM

Jess T

Retired Moderator

21

Years of Service

User Offline

Joined: 20th Sep 2003

Location: Over There... Kablam!

Posted: 11th Apr 2006 05:42 Edited at: 11th Apr 2006 05:44

Link

St# = Pi / 128.0
new
stt# = Pi >> 7

is correct ( you realize that you've spelt it differently, yeah? )
However, since you're dealing with floats, it may not work...

#constant St = Pi / 128.0

Wouldn't work, no, as it detects Pi as a variable, and has a fit ( as far as I can tell ).
What you want to do, instead of using Constants ( they are simply a Search/Replace before compile ), use Globals so that you actually do the calculation, and it then doesn't have to be done ever again

Jess.

Team EOD :: All-Round Nice Guy
Want Better dbHelp Files?

Back to top

Profile PM Email Website

HowDo

22

Years of Service

User Offline

Joined: 28th Nov 2002

Location: United Kingdom

Posted: 11th Apr 2006 07:26

Link

Rem Project: mandeltrees
Rem Created: 08/04/2006 10:31:47

Rem ***** Main Source File *****
REM Initialization
`SCREEN 12
`emstart
`set display mode 1024,768,16
randomize timer()
#constant Pi = 3.14159
#constant g=25
#constant S = 10
#constant K = 1 / SQRt(2)
#constant sw = screen width()/2
#constant sh = screen height()/2

`WINDOW (-S, -S)-(S, S)
REM NIter is the number of iterations
sync off
sync rate 0
NIter = 12
TPoints = 2 ^ NIter
Length# = S / 2
Stp = TPoints / 4

REM a(x, y)holds the coordinates of every branch tip
DIM a(TPoints, 2) as float

REM Calculate plain tree
FOR i = 1 TO NIter - 1
  FOR x = Stp TO TPoints STEP Stp * 4
    IF i MOD 2 = 0
      a(x, 0) = a(x + Stp, 0)
      a(x + 2 * Stp, 0) = a(x + Stp, 0)
      a(x, 1) = a(x + Stp, 1) - Length#
      a(x + 2 * Stp, 1) = a(x + Stp, 1) + Length#
    ELSE
      a(x, 0) = a(x + Stp, 0) - Length#
      a(x + 2 * Stp, 0) = a(x + Stp, 0) + Length#
      a(x, 1) = a(x + Stp, 1)
      a(x + 2 * Stp, 1) = a(x + Stp, 1)
    ENDIF
  NEXT x
  Stp = Stp / 2
  Length# = Length# * K
NEXT i

do
CLS
REM Leave the program when pressing any key

text 0,0,str$(t)+ " fps="+str$(screen fps())+"  st="+str$(st#)
text 0,12, "Press o for st= Pi / 128.0"
text 0,24,"Press n for st = Pi >> 7"
rem +" alfa#="+str$(Alfa#)+"  rn="+str$(rn)+"   alpha2="+str$( RND(8)* St#)+"  st#="+str$(st#)
`IF INKEY$() <> "" THEN END
Stp = TPoints / 4

REM Draw tree
FOR i = 1 TO NIter - 1
  FOR x = Stp TO TPoints STEP Stp * 4
    x0 = a(x, 0)*g
    y0 = a(x, 1)*g
    P2 = 2 * Stp
    x1 = a(x + P2, 0)*g
    y1 = a(x + P2, 1)*g
    LINE sw-x0, sh-y0,sw-x1,sh-y1

NEXT x
  Stp = Stp / 2
NEXT i
sync
Stp = TPoints / 4
`0.024543671875
if inkey$()="o"
St# = Pi / 128.0
endif
if inkey$()="n"
St# = Pi >> 7
endif
REM Rotate Tree Randomly
FOR i = 1 TO NIter - 1
  Counter = 0
  FOR x = Stp TO TPoints - 1 STEP Stp * 2
    P2 = 2 * Stp
    Counter = Counter + 1
    Ax# = a(x, 0)
    Ay# = a(x, 1)
    Az# = a(x, 2)
    IF Counter MOD 2 = 1
      Bx# = a(x + P2, 0)
      By# = a(x + P2, 1)
      Bz# = a(x + P2, 2)
    ELSE
      Bx# = a(x - P2, 0)
      By# = a(x - P2, 1)
      Bz# = a(x - P2, 2)
    ENDIF
    Mn# = SQRt((Bx# - Ax#) ^ 2 + (By# - Ay#) ^ 2 + (Bz# - Az#) ^ 2)
    nx# = (Bx# - Ax#) / Mn#
    ny# = (By# - Ay#) / Mn#
    nz# = (Bz# - Az#) / Mn#

Alfa# = RND(8)* St#
    rn=rnd(10)/100

if rn> .5
     Alfa# = -Alfa#
`  else
  `    alfa#=alfa#
   endif
    ca# = COS(Alfa#)
    sa# = SIN(Alfa#)

FOR j = x - Stp + 1 TO x + Stp - 1

Px# = a(j, 0) - Ax#
      Py# = a(j, 1) - Ay#
      Pz# = a(j, 2) - Az#

nPEscalar# = nx# * Px# + ny# * Py# + nz# * Pz#

nnPx# = nPEscalar# * nx#
      nnPy# = nPEscalar# * ny#
      nnPz# = nPEscalar# * nz#

cx# = ca# * (Px# - nnPx#)
      cy# = ca# * (Py# - nnPy#)
      cz# = ca# * (Pz# - nnPz#)

snxPx# = sa# * (ny# * Pz# - nz# * Py#)
      snxPy# = sa# * (nz# * Px# - nx# * Pz#)
      snxPz# = sa# * (nx# * Py# - ny# * Px#)

a(j, 0) = nnPx# + cx# + snxPx# + Ax#
      a(j, 1) = nnPy# + cy# + snxPy# + Ay#
      a(j, 2) = nnPz# + cz# + snxPz# + Az#
    NEXT j
  NEXT x
  Stp = Stp / 2
NEXT i
`sync
inc t
loop

+ Code Snippet

Rem Project: mandeltrees
Rem Created: 08/04/2006 10:31:47

Rem ***** Main Source File *****
REM Initialization
`SCREEN 12
`emstart
`set display mode 1024,768,16
randomize timer()
#constant Pi = 3.14159
#constant g=25
#constant S = 10
#constant K = 1 / SQRt(2)
#constant sw = screen width()/2
#constant sh = screen height()/2

`WINDOW (-S, -S)-(S, S)
REM NIter is the number of iterations
sync off
sync rate 0
NIter = 12
TPoints = 2 ^ NIter
Length# = S / 2
Stp = TPoints / 4


REM a(x, y)holds the coordinates of every branch tip
DIM a(TPoints, 2) as float

REM Calculate plain tree
FOR i = 1 TO NIter - 1
  FOR x = Stp TO TPoints STEP Stp * 4
    IF i MOD 2 = 0
      a(x, 0) = a(x + Stp, 0)
      a(x + 2 * Stp, 0) = a(x + Stp, 0)
      a(x, 1) = a(x + Stp, 1) - Length#
      a(x + 2 * Stp, 1) = a(x + Stp, 1) + Length#
    ELSE
      a(x, 0) = a(x + Stp, 0) - Length#
      a(x + 2 * Stp, 0) = a(x + Stp, 0) + Length#
      a(x, 1) = a(x + Stp, 1)
      a(x + 2 * Stp, 1) = a(x + Stp, 1)
    ENDIF
  NEXT x
  Stp = Stp / 2
  Length# = Length# * K
NEXT i

do
CLS
REM Leave the program when pressing any key

text 0,0,str$(t)+ " fps="+str$(screen fps())+"  st="+str$(st#)
text 0,12, "Press o for st= Pi / 128.0"
text 0,24,"Press n for st = Pi >> 7"
rem +" alfa#="+str$(Alfa#)+"  rn="+str$(rn)+"   alpha2="+str$( RND(8)* St#)+"  st#="+str$(st#)
`IF INKEY$() <> "" THEN END
Stp = TPoints / 4

REM Draw tree
FOR i = 1 TO NIter - 1
  FOR x = Stp TO TPoints STEP Stp * 4
    x0 = a(x, 0)*g
    y0 = a(x, 1)*g
    P2 = 2 * Stp
    x1 = a(x + P2, 0)*g
    y1 = a(x + P2, 1)*g
    LINE sw-x0, sh-y0,sw-x1,sh-y1

  NEXT x
  Stp = Stp / 2
NEXT i
sync
Stp = TPoints / 4
`0.024543671875
if inkey$()="o"
St# = Pi / 128.0
endif
if inkey$()="n"
St# = Pi >> 7
endif
REM Rotate Tree Randomly
FOR i = 1 TO NIter - 1
  Counter = 0
  FOR x = Stp TO TPoints - 1 STEP Stp * 2
    P2 = 2 * Stp
    Counter = Counter + 1
    Ax# = a(x, 0)
    Ay# = a(x, 1)
    Az# = a(x, 2)
    IF Counter MOD 2 = 1
      Bx# = a(x + P2, 0)
      By# = a(x + P2, 1)
      Bz# = a(x + P2, 2)
    ELSE
      Bx# = a(x - P2, 0)
      By# = a(x - P2, 1)
      Bz# = a(x - P2, 2)
    ENDIF
    Mn# = SQRt((Bx# - Ax#) ^ 2 + (By# - Ay#) ^ 2 + (Bz# - Az#) ^ 2)
    nx# = (Bx# - Ax#) / Mn#
    ny# = (By# - Ay#) / Mn#
    nz# = (Bz# - Az#) / Mn#

    Alfa# = RND(8)* St#
    rn=rnd(10)/100

    if rn> .5
     Alfa# = -Alfa#
`  else
  `    alfa#=alfa#
   endif
    ca# = COS(Alfa#)
    sa# = SIN(Alfa#)

    FOR j = x - Stp + 1 TO x + Stp - 1

      Px# = a(j, 0) - Ax#
      Py# = a(j, 1) - Ay#
      Pz# = a(j, 2) - Az#

      nPEscalar# = nx# * Px# + ny# * Py# + nz# * Pz#

      nnPx# = nPEscalar# * nx#
      nnPy# = nPEscalar# * ny#
      nnPz# = nPEscalar# * nz#

      cx# = ca# * (Px# - nnPx#)
      cy# = ca# * (Py# - nnPy#)
      cz# = ca# * (Pz# - nnPz#)

      snxPx# = sa# * (ny# * Pz# - nz# * Py#)
      snxPy# = sa# * (nz# * Px# - nx# * Pz#)
      snxPz# = sa# * (nx# * Py# - ny# * Px#)

      a(j, 0) = nnPx# + cx# + snxPx# + Ax#
      a(j, 1) = nnPy# + cy# + snxPy# + Ay#
      a(j, 2) = nnPz# + cz# + snxPz# + Az#
    NEXT j
  NEXT x
  Stp = Stp / 2
NEXT i
`sync
inc t
loop

Well this what happends when I try to put the >> part in
press o for old calac and n for new calac.

Whenever I try to make it lose the float parts, it will not work.

open to anyone to try and make it quicker.

I'm not getting you down am I, Ho Look! another fancy Door?

Back to top

Profile PM

Green Gandalf

VIP Member

20

Years of Service

User Offline

Joined: 3rd Jan 2005

Playing: Malevolence:Sword of Ahkranox, Skyrim, Civ6.

Posted: 11th Apr 2006 14:08

Link

I think you might need to look at the following (from your second post):

+ Code Snippet

    Alfa# = RND(8)* St#
    rn=rnd(10)/100

    if rn> .5
     Alfa# = -Alfa#
`  else
  `    alfa#=alfa#
   endif

I think rn is an integer and will always take the value zero according to this code - or is it declared as a float somewhere? Either way it will never exceed 0.1!

Also, you could take

+ Code Snippet

P2 = 2 * Stp

outside the "x" loop at line 79.

Back to top

Profile PM Email

HowDo

22

Years of Service

User Offline

Joined: 28th Nov 2002

Location: United Kingdom

Posted: 11th Apr 2006 14:18 Edited at: 11th Apr 2006 14:27

Link

Green Gandalf I belive you are right because if do not make it float I get div by zero error, only way I could think of making function.

It also seem that any whole number does not work due to the way it does the calaulation, and that is were I am stabing around in the dark.

if anyone is intnrested here where I got it from.
http://www.josechu.com/moving_fractal/index.htm

I'm not getting you down am I, Ho Look! another fancy Door?

Back to top

Profile PM

TheUser

19

Years of Service

User Offline

Joined: 13th Apr 2006

Location:

Posted: 13th Apr 2006 19:25

Link

I think that Alfa is a random float number.

It is: Alfa = INT(RND * 8) * St

As (in qbasic) RND goes from 0.0000... to 0.99999...., and St is Pi/128, Alfa is a small random angle which goes from 0.0 to 0.196 radians. Or from 0.0 to 11.25 degrees.

Of course -Alfa goes from -0.0 to -0.196 radians

I think that every branch, big or small, rotates that float random quantity on each iteration.

yours,

Back to top

Profile PM

TheUser

19

Years of Service

User Offline

Joined: 13th Apr 2006

Location:

Posted: 13th Apr 2006 19:53

Link

I think that Alfa is a small random angle that goes from -0.196 radians (-Alfa) to 0.196 radians. It is a float (RND in qbasic is a float that goes from 0.0000... to 0.9999....)

It is the angle rotated by every branch, big or small, on each iteration.

Back to top

Profile PM

Sorry your browser is not supported!

Code Snippets / Moving fractal tree in DBPro