Painter's algorithm: Difference between revisions

Content deleted Content added
Added a picture of a painters algorithm in Scratch
m Moved Scratch render to better spot
Line 26:
 
== Advantages ==
[[File:Dolphin_3D_engine_render.png|thumb|AThe renderpainters fromalgorithm theis Dolphinfast Engineenough onfor Scratch to run it well. The engineproject is found here: https://scratch.mit.edu/projects/1132078952/]]
There are two primary technical requisites that favor the use of the painter's algorithm.
 
Line 33 ⟶ 34:
=== Memory efficiency ===
In the early 70s, when the painter's algorithm was developed, physical memory was relatively small.<ref>{{Cite journal|last1=Freiser|first1=M.|last2=Marcus|first2=P.|date=June 1969|title=A survey of some physical limitations on computer elements|url=https://ieeexplore.ieee.org/document/1066403|journal=IEEE Transactions on Magnetics|volume=5|issue=2|pages=82–90|doi=10.1109/TMAG.1969.1066403|bibcode=1969ITM.....5...82F|issn=1941-0069}}</ref> This required programs to manage memory as efficiently as possible to conduct large tasks without crashing. The painter's algorithm prioritizes the efficient use of memory but at the expense of higher processing power since all parts of all images must be rendered.<ref name=":1" />
[[File:Dolphin_3D_engine_render.png|thumb|A render from the Dolphin Engine on Scratch. The engine is here: https://scratch.mit.edu/projects/1132078952/]]
 
== Limitations ==