CloudFlare suffered a massive security issue affecting all of its customers, including Rosetta Code. All passwords not changed since February 19th 2017 have been expired, and session cookie longevity will be reduced until late March.--Michael Mol (talk) 05:15, 25 February 2017 (UTC)

Talk:Sierpinski triangle/Graphical

From Rosetta Code

How to added imbedded file[edit]

Anyone tell me how to add a graphics file as example? The embedded file widget just gives an example. It doesn't seem to give me a way to upload the file.

Thanks, --Dgamey 01:32, 6 May 2011 (UTC)

You can't upload here? This link is in the bottom of the sidebar -- "Upload file". --Mwn3d 01:52, 6 May 2011 (UTC)
Thanks - I have to learn to scroll down :) --Dgamey 12:00, 6 May 2011 (UTC)
I can't find the "upload file" link in the sidebar. -- Gerard Schildberger (talk) 21:57, 28 August 2013 (UTC)

Additional requirements[edit]

Take a parameter N for order (by command line is fine)
Calculate canvas size to allow for N (up to a limit)

--Dgamey 01:57, 6 May 2011 (UTC)

What's all this talk about canvas size for N? What's N got to do with how big the triangle is? --Ledrug 03:31, 5 July 2011 (UTC)
First guess: So that no anti-aliasing or sub-pixel considerations are required to draw the image, so that representing the image using a 1-bit palette makes sense, and so such things don't cause an "oversaturation" of the resulting image such that you end up with a large, solid Triforce image. --Michael Mol 15:44, 5 July 2011 (UTC)
If the task has that in mind, it's going to be quite limiting: for pretty much all vector drawing languages/libraries, these are automatically handled when rasterizing, so it's redundant to link N to image size. Maybe it should be clarified a little. --Ledrug 21:43, 5 July 2011 (UTC)
Strictly speaking only Unicon and TCL speak of canvas size. The task just says order N. --Dgamey 01:34, 6 July 2011 (UTC)


I didn't see a reference or anything in the WP article about what order N is. N appears to be the number of times the triangle is subdivided giving 2^N triangles per side. Seems obvious to me but it may not be to others.

--Dgamey 12:00, 6 May 2011 (UTC)