Sierpinski triangle/Graphical: Difference between revisions

It uses 320x200 mode, so the maximum order is 7.

 

;;; (order 7 is the maximum that fits in 200 lines)

mode: equ 0Fh ; INT 10H call to get current video mode

section .bss

order: resb 1 ; Order of Sierpinski triangle

 

=={{header|Action!}}==

BYTE i,x,y,size

 

DO UNTIL CH#$FF OD

CH=$FF

{{out}}

[https://gitlab.com/amarok8bit/action-rosetta-code/-/raw/master/images/Sierpinski_triangle_graphical.png Screenshot from Atari 8-bit computer]

=={{header|ActionScript}}==

SierpinskiTriangle class:

package {

 

}

 

Document class:

package {

 

}

 

=={{header|Asymptote}}==

This simple-minded recursive apporach doesn't scale well to large orders, but neither would your PostScript viewer, so there's nothing to gain from a more efficient algorithm. Thus are the perils of vector graphics.

 

return

point(p, node) --

}

 

Una versión mas corta:

 

void sierpinski(pair p, int d) {

}

 

 

=={{header|ATS}}==

{{libheader|SDL}}

#include "share/atspre_staload.hats"

 

SDL_RenderDrawLine(sdlren, x1, y1, x2, y2);

}

 

=={{header|AutoHotkey}}==

{{libheader|GDIP}}

#SingleInstance, Force

SetBatchLines, -1

If (A_Gui = 1)

PostMessage, 0xA1, 2

 

 

{{works with|QBasic}}

<!-- {{works with|QBasic}} codificado por: Kibbee, 12 junio 2012 -->

SCREEN 9

H=.5

PSET(P-X*P,P-Y*P)

NEXT

[https://www.dropbox.com/s/c3g1ae1i771ox7g/Sierpinski_triangle_QBasic.png?dl=0 Sierpinski triangle QBasic image]

 

==={{header|BBC BASIC}}===

{{works with|BBC BASIC for Windows}}

size% = 2^order%

VDU 23,22,size%;size%;8,8,16,128

NEXT

NEXT Y%

[[File:sierpinski_triangle_bbc.gif]]

 

==={{header|FreeBASIC}}===

' compile with: fbc -s console or with: fbc -s gui

 

WindowTitle "Hit any key to end program"

Sleep

 

==={{header|IS-BASIC}}===

110 SET VIDEO MODE 1:SET VIDEO COLOR 0:SET VIDEO X 40:SET VIDEO Y 27

120 OPEN #101:"video:"

210 PLOT X,Y;X+W/2,Y+W;X+W,Y;X,Y

220 END IF

 

==={{header|Liberty BASIC}}===

The ability of LB to handle very large integers makes the Pascal triangle method very attractive. If you alter the rem'd line you can ask it to print the last, central term...

nomainwin

 

end

end sub

Up to order 10 displays on a 1080 vertical pixel screen.

 

==={{header|Run BASIC}}===

[[File : SierpinskiRunBasic.png|thumb|right]]

order = 8

width = 100

render #g

#g "flush"

 

==={{header|SmileBASIC}}===

{{Trans|Action!}}

OPTION DEFINT

DEF DRAW X0, Y0, DEPTH

END

CALL "DRAW", 96, 32, 7

 

==={{header|TI-83 BASIC}}===

:Zdecimal

:Horizontal 3.1

:If pxl-Test(Y-1,X) xor (pxl-Test(Y,X-1

:PxlOn(Y,X

This could be made faster, but I just wanted to use the DS<( command

 

 

3D version.

 

//Sierpinski triangle gasket drawn with lines from any 3 given points

SierLineTri(cx, cy, cx+r*cos(2*pi/N*i), cy +r*sin(2*pi/N*i), cx + r*cos(2*pi/N*(i+1)), cy + r*sin(2*pi/N*(i+1)), 5)

next i

 

Simple recursive version

open window w, h

window origin "lb"

end sub

 

 

=={{header|C}}==

[[file:sierp-tri-c.png|thumb|center|128px]]Code lifted from [[Dragon curve]]. Given a depth n, draws a triangle of size 2^n in a PNM file to the standard output. Usage: <code>gcc -lm stuff.c -o sierp; ./sierp 9 > triangle.pnm</code>. Sample image generated with depth 9. Generated image's size depends on the depth: it plots dots, but does not draw lines, so a large size with low depth is not possible.

 

#include <stdlib.h>

#include <string.h>

return 0;

 

=={{header|C++}}==

[[file:STriCpp.png|thumb|right|200px]]

#include <windows.h>

#include <string>

return 0;

}

 

=={{header|D}}==

The output image is the same as the Go version. This requires the module from the Grayscale image Task.

{{trans|Go}}

import grayscale_image;

 

im[x + margin, y + margin] = Gray.black;

im.savePGM("sierpinski.pgm");

 

=={{header|Erlang}}==

-module(sierpinski).

-author("zduchac").

}]),

wxFrame:show(Frame).

 

=={{header|ERRE}}==

PROGRAM SIERPINSKY

 

GET(K$)

END PROGRAM

 

=={{header|Factor}}==

math.bits math.functions make sequences ;

IN: rosetta-code.sierpinski-triangle-graphical

"sierpinski-triangle.png" save-graphic-image ;

 

{{out}}

[https://i.imgur.com/wjwCrvL.png]

=={{header|Forth}}==

{{works with|4tH v3.62}}

 

520 pic_width ! \ width of the image

: triangle 1 order lshift dup 0 do dup 0 do i j ?pixel loop loop drop ;

 

{{Out}}''Because Rosetta code doesn't allow file uploads, the output can't be shown.''

=={{header|gnuplot}}==

Generating X,Y coordinates by the ternary digits of parameter t.

 

# Sierpinski triangle point number n, for integer n.

triangle_x(n) = (n > 0 ? 2*triangle_x(int(n/3)) + digit_to_x(int(n)%3) : 0)

set parametric

set key off

 

=={{header|Go}}==

[[file:GoSierpinski.png|right|thumb|Output png]]

{{trans|Icon and Unicon}}

 

import (

fmt.Println(err)

}

 

=={{header|Haskell}}==

 

[[File:Sierpinski-Haskell.svg|thumb|Sierpinski Triangle]]

import Diagrams.Backend.Cairo.CmdLine

 

 

main = defaultMain $ sierpinski !! 7

 

=={{header|Icon}} and {{header|Unicon}}==

 

[[File:Sierpinski_Triangle_Unicon.PNG|thumb|Sample Output for order=8]]

 

procedure main(A)

 

Event()

{{libheader|Icon Programming Library}}

[http://www.cs.arizona.edu/icon/library/src/gprogs/sier1.icn Original source IPL Graphics/sier1.]

=={{header|J}}==

'''Solution:'''

 

This looks almost exactly (except for OS specific decorations) like the [[:File:Sierpinski_Triangle_Unicon.PNG|task example image]]

Other approaches are possible

 

 

 

And, of course, other approaches are [[j:File:Triangle.png|viable]].

=={{header|Java}}==

'''Solution:'''

import java.awt.*;

 

drawSierpinskyTriangle(level-1, x, y+size/2, size/2, g);

}

 

===Animated version===

{{works with|Java|8}}

import java.awt.event.ActionEvent;

import java.awt.geom.Path2D;

});

}

 

=={{header|JavaScript}}==

{{Works with|Chrome}}

[[File:SierpTRjs.png|200px|right|thumb|Output SierpTRjs.png]]

<!-- SierpinskiTriangle.html -->

<html>

<!--canvas id="cvsId" width="1280" height="1280" style="border: 2px inset;"></canvas-->

</body></html>

{{Output}}

<pre>

depending on the location of the included file, and the command-line

options used.

 

# Compute the curve using a Lindenmayer system of rules

sierpinski_curve(5)

| svg

 

=={{header|Julia}}==

Produces a png graphic on a transparent background. The brushstroke used for fill might need to be modified for a white background.

using Luxor

 

finish()

preview()

 

=={{header|Kotlin}}==

'''From Java code:'''

import javax.swing.JFrame

import javax.swing.JPanel

drawSierpinskyTriangle(level - 1, x, y + size / 2, size / 2)

}

 

=={{header|Logo}}==

This will draw a graphical Sierpinski gasket using turtle graphics.

if :n = 0 [stop]

repeat 3 [sierpinski :n-1 :length/2 fd :length rt 120]

end

 

=={{header|Lua}}==

{{libheader|LÖVE}}

function sierpinski (tri, order)

local new, p, t = {}

function love.draw ()

sierpinski({400, 100, 700, 500, 100, 500}, 7)

[[File:Love2D-Sierpinski.jpg]]

 

=={{header|Mathematica}}/{{header|Wolfram Language}}==

Nest[Join @@ Table[With[{a = #[[i, 1]], b = #[[i, 2]], c = #[[i, 3]]},

{{a, (a + b)/2, (c + a)/2}, {(a + b)/2, b, (b + c)/2}, {(c + a)/2, (b + c)/2, c}}],

{i, Length[#]}] &, {{{0, 0}, {1/2, 1}, {1, 0}}}, n]

Another faster version

With[{a = A[[1]], b = A[[2]], c = A[[3]]},

With[{ab = (a + b)/2, bc = (b + c)/2, ca = (a + c)/2},

n = 3;

pts = Flatten[Nest[cf, N@{{{0, 0}, {1, 0}, {1/2, √3/2}}}, n], n];

 

[[File:MmaSierpinski.png]]

=={{header|MATLAB}}==

===Basic Version===

for k = 1 : 6

x = x(:,:) + x0 * 2 ^ k / 2;

end

{{out}}

Fail to upload output image, use the one of PostScript:

 

===Bit Operator Version===

 

=={{header|Nim}}==

{{libheader|imageman}}

Our triangle is ref on a black background.

 

const

image.fill(Black)

image.drawSierpinski([400.0, 100.0, 700.0, 500.0, 100.0, 500.0], 7)

 

=={{header|Objeck}}==

use Game.Framework;

 

SCREEN_HEIGHT := 480

}

 

=={{header|OCaml}}==

 

 

let round v =

let res = loop 6 [ initial_triangle ] in

List.iter draw_triangle res;

 

run with:

[[File:SierpT9.png|right|thumb|Output SierpT9.png]]

 

\\ Sierpinski triangle fractal

\\ Note: plotmat() can be found here on

pSierpinskiT(9); \\ SierpT9.png

}

{{Output}}

=={{header|Perl}}==

{{trans|Raku}}

my $side = 512;

my $height = get_height($side);

'<g style="fill: #fff; stroke-width: 0;">',

fractal( $side/2, $height, $side*3/4, $height/2, $side/4, $height/2, $levels ),

[https://github.com/SqrtNegInf/Rosettacode-Perl5-Smoke/blob/master/ref/sierpinski_triangle.svg See sierpinski_triangle] (offsite .svg image)

 

Can resize, and change the level from 1 to 12 (press +/-).

{{libheader|Phix/pGUI}}

<span style="color: #000080;font-style:italic;">-- demo\rosetta\SierpinskyTriangle.exw</span>

<span style="color: #008080;">include</span> <span style="color: #000000;">pGUI</span><span style="color: #0000FF;">.</span><span style="color: #000000;">e</span>

<span style="color: #008080;">end</span> <span style="color: #008080;">procedure</span>

<span style="color: #000000;">main</span><span style="color: #0000FF;">()</span>

 

=={{header|PicoLisp}}==

[[File:Pil_sierpinski.png|thumb|right]]

Slight modification of the [[Sierpinski_triangle#PicoLisp|text version]], requires ImageMagick's display:

(let (D '("1") S "0")

(do N

(prinl (length (car Img)) " " (length Img))

(mapc prinl Img) ) )

 

=={{header|PostScript}}==

[[File:Sierpinski-PS.png|thumb|right]]

 

/sierp { % level ax ay bx by cx cy

 

6 50 100 550 100 300 533 sierp

 

=={{header|Processing}}==

===Pixel based===

 

PVector [] coord = {new PVector(0, 0), new PVector(150, 300), new PVector(300, 0)};

 

}

}

 

===Animated===

int depth = 5;

int interval = 50;

}

}

 

===3D version===

import peasy.*;

 

}

}

 

=={{header|Prolog}}==

 

Works up to sierpinski(13).

sformat(A, 'Sierpinski order ~w', [N]),

new(D, picture(A)),

draw_Sierpinski(Window, N1, point(X, Y), Len1),

draw_Sierpinski(Window, N1, point(X1, Y1), Len1),

 

===Iterative version===

 

sierpinski_iterate(N) :-

; Lst2 = [point(X2, Y1)|Lst1]),

 

 

=={{header|Python}}==

{{libheader|Turtle}}

# a very simple version

import turtle as t

t.fd(length)

t.rt(120)

 

{{libheader|PyLab}}

[https://www.dropbox.com/s/gxnl8r8z0kbwi5v/Sierpinski_triangle_Phyton.png?dl=0 Sierpinski triangle image]

# otra versión muy simple

from pylab import*

for i in'123':x=kron(x,x)

imsave('a',x)

 

{{libheader|NumPy}}

{{libheader|Turtle}}

[[File:SierpinskiTriangle-turtle.png|thumb|right]]

##########################################################################################

# a very complicated version

turt.forward(fwd)

return [turn, point, fwd, angle, turt]

# The drawing function

# --------------------

 

DrawSierpinskiTriangle(5)

 

=={{header|Quackery}}==

 

[ 1 & ] is odd ( n --> b )

400 1 fly

3 8 turn

 

{{output}}

[[File:SierpTRo6.png|200px|right|thumb|Output SierpTRo6.png]]

[[File:SierpTRo8.png|200px|right|thumb|Output SierpTRo8.png]]

## Plotting Sierpinski triangle. aev 4/1/17

## ord - order, fn - file name, ttl - plot title, clr - color

pSierpinskiT(6,,,"red");

pSierpinskiT(8);

{{Output}}

<pre>

=={{header|Racket}}==

[[File : RacketSierpinski.png|thumb|right]]

#lang racket

(require 2htdp/image)

(let ([t (sierpinski (- n 1))])

(freeze (above t (beside t t))))))

Test:

;; the following will show the graphics if run in DrRacket

(sierpinski 8)

(require file/convertible)

(display-to-file (convert (sierpinski 8) 'png-bytes) "sierpinski.png")

 

=={{header|Raku}}==

[[File:Sierpinski-perl6.svg|thumb]]

This is a recursive solution. It is not really practical for more than 8 levels of recursion, but anything more than 7 is barely visible anyway.

my $side = 512;

my $height = get_height($side);

'<g style="fill: #fff; stroke-width: 0;">',

fractal( $side/2, $height, $side*3/4, $height/2, $side/4, $height/2, $levels ),

 

=={{header|Ring}}==

load "guilib.ring"

 

}

label1 { setpicture(p1) show() }

 

Output:

{{libheader|Shoes}}

[[File : sierpinski.shoes.png|thumb|right]]

def triangle(slot, tri, color)

x, y, len = tri

end

end

 

{{libheader|RubyGems}}

{{libheader|JRubyArt}}

JRubyArt is a port of processing to ruby

T_HEIGHT = sqrt(3) / 2

TOP_Y = 1 / sqrt(3)

triangle(cx0, cy0, cx1, cy1, cx2, cy2)

end

 

=={{header|Rust}}==

Output is an SVG file.

// svg = "0.8.0"

 

fn main() {

write_sierpinski_triangle("sierpinski_triangle.svg", 600, 8).unwrap();

 

{{out}}

=={{header|Seed7}}==

[[File : SierpinskiSeed7.png|thumb|right]]

include "draw.s7i";

include "keybd.s7i";

end for;

ignore(getc(KEYBOARD));

 

Original source: [http://seed7.sourceforge.net/algorith/graphic.htm#sierpinski]

=={{header|Sidef}}==

[[File:Sierpinski_triangle_sidef.png|200px|thumb|right]]

var triangle = ['*']

{ |i|

var triangle = sierpinski_triangle(8)

var raw_png = triangle.to_png(bgcolor:'black', fgcolor:'red')

 

=={{header|Tcl}}==

This code maintains a queue of triangles to cut out; though a stack works just as well, the observed progress is more visually pleasing when a queue is used.

{{libheader|Tk}}

package require Tk

 

pack [canvas .c -width 400 -height 400 -background white]

update; # So we can see progress

 

=={{header|VBScript}}==

VBScript does'nt have access to windows graphics. To achieve this i had to implement turtle graphics wtiting SVG commands to an HTML file. At the end the program opens the graphics in the default browser.

 

option explicit

sier 7,64

set x=nothing 'outputs html file to browser

 

=={{header|Wren}}==

{{trans|Kotlin}}

{{libheader|DOME}}

import "dome" for Window

 

}

}

 

=={{header|XPL0}}==

[[File:TriangXPL0.gif|right]]

def Order=7, Size=1<<Order;

int X, Y;

X:= ChIn(1); \wait for keystroke

SetVid(3); \restore normal text display

 

=={{header|zkl}}==

Uses the PPM class from http://rosettacode.org/wiki/Bitmap/Bresenham%27s_line_algorithm#zkl

{{trans|XPL0}}

img:=PPM(300,300);

foreach y,x in (Size,Size){ if(x.bitAnd(y)==0) img[x,y]=0xff0000 }