This is a living document. Everything in this document is made in good faith of being accurate, but like I just said; we don't yet know everything about what's going on.
Update: I've disabled comments as of 2025-01-26 to avoid everyone having notifications for something a year on if someone wants to suggest a correction. Folks are free to email to suggest corrections still, of course.
sRGB learning curve
https://gamedevdaily.io/the-srgb-learning-curve-773b7f68cf7a#.y9sitvhmm
Color Math
http://www.essentialmath.com/GDC2015/VanVerth_Jim_DoingMathwRGB.pdf
The Importance of Terminology and sRGB Uncertainty
http://colour-science.org/posts/the-importance-of-terminology-and-srgb-uncertainty/
| /** | |
| * K.jpg's OpenSimplex 2, smooth variant ("SuperSimplex") | |
| * | |
| * More language ports, as well as legacy 2014 OpenSimplex, can be found here: | |
| * https://github.com/KdotJPG/OpenSimplex2 | |
| */ | |
| public class OpenSimplex2S { | |
| private static final long PRIME_X = 0x5205402B9270C86FL; |
| // Copyright (c) 2021 Stoiko Todorov | |
| // This work is licensed under the terms of the MIT license. | |
| // For a copy, see https://opensource.org/licenses/MIT. | |
| // What this function does: | |
| // Rasterizes a single Field Of View octant on a grid, similar to the way | |
| // field of view / line of sight / shadowcasting is implemented in some | |
| // roguelikes. | |
| // Uses rays to define visible volumes instead of tracing lines from origin | |
| // to pixels. |
| // Iterates through all of the X.509 digital certificates installed in the certificate store | |
| // on a Windows operating system, dumping out some metadata about each. Each certificate, in | |
| // each Certificate Store, from each Certificate Location is included. | |
| // | |
| // Bill Wilder | @codingoutloud | Oct 2012 | |
| // Original: https://gist.github.com/4005661 | |
| using System; | |
| using System.Linq; | |
| using System.Security.Cryptography.X509Certificates; |
The Liang-Barsky algorithm is a cheap way to find the intersection points between a line segment and an axis-aligned rectangle. It's a simple algorithm, but the resources I was pointed to didn't have particularly good explanations, so I tried to write a better one.
Consider a rectangle defined by x_min ≤ x ≤ x_max and y_min ≤ y ≤ y_max, and a line segment from (x_0, y_0) to (x_0 + Δ_x, y_0 + Δ_y). We'll be assuming at least one of Δ_x and Δ_y is nonzero.
(I'm working with Flash, so I'll be using the convention that y increases as you go down.)
We want to distinguish between the following cases:
| /** | |
| * @file fsm.c | |
| * @brief an implementation for a FSM in C, this file contains | |
| * implementation of definations. | |
| * License GPLv3+ | |
| * @author Ankur Shrivastava | |
| */ | |
| #include "fsm.h" | |
| #include<stdlib.h> |
