safijari

donmahallem

silvesthu

GPU Optimization for GameDev

Graphics Pipeline / GPU Architecture Overview

• 2011 - A trip through the Graphics Pipeline 2011
• 2015 - Life of a triangle - NVIDIA's logical pipeline
• 2015 - Render Hell 2.0
• 2016 - How bad are small triangles on GPU and why?
• 2017 - GPU Performance for Game Artists
• 2019 - Understanding the anatomy of GPUs using Pokémon
• 2020 - GPU ARCHITECTURE RESOURCES

thefranke

The RSS Endpoint List

Please refer to this blogpost to get an overview.

Replace *-INSTANCE with one of the public instances listed in the scrapers section. Replace CAPITALIZED words with their corresponding identifiers on the website.

Social Media

Twitter

rngtm

using UnityEngine;
using UnityEditor.ShaderGraph;
using System.Reflection;

/// <summary>
/// ドメインワーピング(http://www.iquilezles.org/www/articles/warp/warp.htm)
/// </summary>
[Title("Custom", "Domain Warping(@iquilezles)")]
public class DomainWarpingNode : CodeFunctionNode 
{

paniq

Borrow Inference

by Leonard Ritter, Duangle GbR

This document has only historical significance and does not describe the borrow checker as it is now implemented. Please see this document for a more recent description.

This is a description of borrow inference, an alternative to borrow checking that requires no declarative annotations to support proper management of unique values and borrowed references at compile time.

sketchpunk

import Vec3 from "/fungi/maths/Vec3.js";

class Bezier{
	static get(p0, p1, p2, p3, t, out){
		let i		= 1 - t,
			ii		= i * i,
			iii		= ii * i,
			tt 		= t * t,
			ttt 	= tt * t,
			iit3 	= 3 * ii * t,

rxwei

See the official Differentiable Programming Manifesto instead.

phi-lira

Use https://gist.github.com/phi-lira/225cd7c5e8545be602dca4eb5ed111ba instead.

sebbbi

Spherical cap cone analytic solution is a 1d problem, since the cone cap sphere slides along the ray. The intersection point to empty space sphere is always on the ray.

S : radius of cone cap sphere at t=1
r(d) : cone cap sphere radius at distance d

r(d) = d*S

p = distance of current SDF sample
SDF(p) = sdf function result at location p
x = distance after conservative step