tinyrenderer VS javascript-algorithms

I don’t think that exists (I sure would like for it to), but until it does you could amuse yourself with:

- A 500-line (non-OpenGL-compatible) 3D rasterizer: https://github.com/ssloy/tinyrenderer/wiki.

- A “hello Wayland” app written in C without libwayland or anything else: https://gaultier.github.io/blog/wayland_from_scratch.html.

- A “hello X11” app written in x86-64 assembly(!) without libX11, libxcb, or anything else: https://gaultier.github.io/blog/x11_x64.html.

the tinyrenderer[1] project has been on my todos forever now. glad to see the author is writing more self-paced programming projects.

[1]: https://github.com/ssloy/tinyrenderer

- Game development - Unity3D project based learning in C#: https://learn.unity.com/ - Graphics - There was another user on r/GraphicsProgramming the other day (who teaches Computer Graphics at his university) that linked their lecture series for the entry year of their course here: https://tamats.com/learn/realtime-graphics/ - Project based learning: https://github.com/ssloy/tinyrenderer/wiki - Rendering API tutorials: https://vulkan-tutorial.com/, https://learnopengl.com/

There are a couple of excellent resources out there for implementing 3D rendering from scratch.

On that I cannot recommend enough is this github repo:

https://github.com/ssloy/tinyrenderer/wiki/Lesson-0:-getting...

If you are more of a visual learner, this guy is also a treasure trove:

https://www.youtube.com/watch?v=ih20l3pJoeU

Other people have mentioned ray-tracing in one weekend

If anyone is really interested in graphics I would also recommend TinyRenderer

https://github.com/ssloy/tinyrenderer/wiki

This one is a CPU-based rasterizing renderer

Its good if you want to get a good understanding of what a GPU does underneath

I was in a similar position to you, and I first did this https://github.com/ssloy/tinyrenderer/wiki

Yes, my thoughts exactly, shader!=program on GPU. It's just a code which calculates pixel color or pixel position. See for example this: https://github.com/ssloy/tinyrenderer/blob/master/main.cpp. It's not GLSL or anything uploadable to GPU yet it's still a shader.

In terms of a project which would be worthwhile, I think building a software rasterizer from scratch is a useful first step. TinyRenderer is a great place to start. Looking at the high level overview of many graphics subjects, ScratchAPixel is a valuable resource. Theres also just great information in some of the rote graphics programming textbooks (Michael Abrash's Black Book fully available online from Jason Gregory, and this book is really interesting). The "RayTracer in a weekend" series is also (seemingly) very illuminating (no pun intended).

been on my 3D todo list for a while. you might also like these:

https://github.com/ssloy/tinyrenderer

https://github.com/zauonlok/renderer

I'm reminded of the time when some kid wrote a script to crawl GitHub and create issues[1] about using inclusive language... except it was really dumb, for example: https://github.com/trekhleb/javascript-algorithms/pull/875/f...

[1] E.g.: https://github.com/EbookFoundation/free-programming-books/pu...

Try codewars or leetcode Or you can use this repo for ds practice https://github.com/trekhleb/javascript-algorithms

This one is pretty popular too.

for algos - not sure how much you'll need to do for a jr position but familiarity with some of the beginner stuff here couldn't hurt: https://github.com/trekhleb/javascript-algorithms

Traditionally, a linked list allows you to insert before/after a node. i.e. addBefore(node,value) (see [2] ) He doesn't implement addBefore & addAfter.

Instead, he provides a whole bunch of non-canonical helpers like reverse(), toArray(), deleteTail() etc - these are typical LC-Easy problems that don't belong inside the data structure.

My own introduction to these things was a C course called "Data Structures in C" in the traditional CS curriculum, and yes, you would have to malloc a new node, get back a pointer with a memory address, & the process of pointing the next pointer of the current node to this new node so that the memory address of the next value was explicitly "linked" to the current value and hence linked list etc...I guess much of that terminology is lost on the new generation in the absence of pointers & memory addresses.

The canonical exercise in those days was - Show that a linked list does not store objects in contiguous memory, unlike an array. So to solve this, you would traverse the list from the head node & print the actual addresses of the memory locations along the way, proving that the vals aren't stored contiguously. I wonder what that exercise would mean in JS land.

That said, yeah its a good starting point & I applaud the effort.

[1]https://github.com/trekhleb/javascript-algorithms/blob/maste...

You could also check out: 1. 30 seconds of code 2. JavaScript30 3. JavaScript Algorithms