feat: Hidden points removal

[mithi]

And other techniques painter’s algorithm, back face culling, and/or depth buffering

• https://www.gabrielgambetta.com/computer-graphics-from-scratch/clipping.html
• https://www.gabrielgambetta.com/computer-graphics-from-scratch/hidden-surface-removal.html
• https://www.javatpoint.com/computer-graphics-hidden-surface-removal

Sweep-Line Algorithm for Line Segment Intersection (2/5) | Computational Geometry - Lecture 02

• https://www.youtube.com/watch?v=qkhUNzCGDt0

Check if two line segments intersect

• https://www.youtube.com/watch?v=bbTqI0oqL5U

How to check if two given line segments intersect? | GeeksforGeeks https://www.youtube.com/watch?v=wCR48FqkI4w

Some relevant discussions here: https://www.reddit.com/r/compsci/comments/il9bb5/for_a_tiny_3d_rendering_for_projecting_only_3d/

This repo is an amazing resource https://github.com/volfegan/GeometricAlgorithms

Sweep-Line and Segment Intersection http://www.cs.cmu.edu/afs/cs/academic/class/15451-s16/www/lectures/lec26-segments-intersect.pdf lec26-segments-intersect.pdf

Bentley–Ottmann algorithm https://en.wikipedia.org/wiki/Bentley%E2%80%93Ottmann_algorithm#Detailed_algorithm

A Short Survey of Intersection Algorithms http://geomalgorithms.com/a09-_intersect-3.html

Casey Muratori, “Gilbert Johnson Keerthi" https://www.youtube.com/watch?v=Qupqu1xe7Io https://caseymuratori.com/blog_0003