Explore >> Select a destination
|
You are here 
|
madebyme.today | ||
| | | | |
www.jeremykun.com
|
|
| | | | | So far in this series we've seen elliptic curves from many perspectives, including the elementary, algebraic, and programmatic ones. We implemented finite field arithmetic and connected it to our elliptic curve code. So we're in a perfect position to feast on the main course: how do we use elliptic curves to actually do cryptography? History As the reader has heard countless times in this series, an elliptic curve is a geometric object whose points have a surprising and well-defined notion of addition. | |
| | | | |
blog.demofox.org
|
|
| | | | | This post explains how to use sliced optimal transport to make blue noise point sets. The plain, well commented C++ code that goes along with this post, which made the point sets and diagrams, is at https://github.com/Atrix256/SOTPointSets. This is an implementation and investigation of "Sliced Optimal Transport Sampling" by Paulin et al (http://www.geometry.caltech.edu/pubs/PBCIW+20.pdf).?They also have... | |
| | | | |
weblog.jamisbuck.org
|
|
| | | | | ||
| | | | |
www.jakobmaier.at
|
|
| | | In this project I wrote a monte-carlo path tracer in C++ with some nice features, including mesh rendering, direct light sampling and various different materials. | ||
