Explore >> Select a destination
|
You are here 
|
frozenfractal.com | ||
| | | | |
algassert.com
|
|
| | | | | Craig Gidney's computer science blog | |
| | | | |
www.reedbeta.com
|
|
| | | | | When you read BRDF theory papers, you'll often see mention of slope space. Sometimes, components of the BRDF such as NDFs or masking-shadowing functions are defined in slope space, or operations are done in slope space before being converted back to ordinary vectors or polar coordinates. However, the meaning and intuition of slope space is rarely explained. Since it may not be obvious exactly what slope space is, why it is useful, or how to transform things to and from it, I thought I would write down a ... | |
| | | | |
kvachev.com
|
|
| | | | | Grids are great for tactical gameplay of turn-based games because they allow discrete movement steps. That means that you can bind positioning to other resources such as movement points, action points, food, etc. Grids divide the infinite variety of movement options into a few specific ones, which can be considered separately by the players tactical mind. The most popular grid types are hexes and squares. But what about triangles? | |
| | | | |
www.jeremykun.com
|
|
| | | This post is a sequel to Formulating the Support Vector Machine Optimization Problem. The Karush-Kuhn-Tucker theorem Generic optimization problems are hard to solve efficiently. However, optimization problems whose objective and constraints have special structure often succumb to analytic simplifications. For example, if you want to optimize a linear function subject to linear equality constraints, one can compute the Lagrangian of the system and find the zeros of its gradient. More generally, optimizing... | ||
