Difference between revisions of "Sierpinski Assignment"
Jump to navigation
Jump to search
Line 24: | Line 24: | ||
=Code To Implement= | =Code To Implement= | ||
− | {{RacketToImplement|sierpinski|sierpinski-triangle<br>sierpinski-carpet| | + | {{RacketToImplement|sierpinski|sierpinski-triangle<br>sierpinski-carpet|sierpinski}} |
==Triangle== | ==Triangle== | ||
[https://en.wikipedia.org/wiki/Sierpi%C5%84ski_triangle Sierpiński Triangle] | [https://en.wikipedia.org/wiki/Sierpi%C5%84ski_triangle Sierpiński Triangle] |
Latest revision as of 20:36, 27 March 2023
Contents
Motivation
We will recursively generate some images with the Racket Image Library.
Code To Investigate
placement
shapes
Spacer
; fully transparent rectangle (define (spacer-rect w h) (rectangle w h "outline" (color 0 0 0 0))) ; fully transparent image the size of img (define (spacer-image img) (spacer-rect (image-width img) (image-height img)))
Code To Implement
file: | src/main/racket/sierpinski/sierpinski.rkt | ![]() |
functions: | sierpinski-triangle sierpinski-carpet |
Triangle
(define (sierpinski-triangle side-length n) (raise 'not-yet-implemented #t))
![]() |
![]() |
![]() |
![]() |
![]() |
n=0 | n=1 | n=2 | n=3 | n=4 |
Note: this has a remarkably clean solution. It is almost as if the Racket Image Library was created to build the Sierpiński Triangle.
Carpet
(define (sierpinski-carpet side-length n) (raise 'not-yet-implemented #t))
![]() |
![]() |
![]() |
![]() |
![]() |
n=0 | n=1 | n=2 | n=3 | n=4 |