| void main() | |
| { | |
| vec3 positionX = backproject(depthTexture(pixelCoordinateI), inverseViewProjectionMatrix); | |
| vec3 normalX = normalTexture(pixelCoordinateI); | |
| // get ONB to transform samples | |
| mat3 orthoNormalBasis = computeONB(normalX); | |
| // select samples for pixel out of pattern | |
| int patternOffset = getPatternOffset(pixelCoordinateI); | |
| float ao = 0.0; |
| #include <windows.h> | |
| #include <GL/gl.h> | |
| #include <stdio.h> | |
| #pragma comment(lib, "opengl32.lib") | |
| void glview() | |
| { | |
| HWND hWnd = CreateWindow(L"ListBox", L"Title", WS_OVERLAPPEDWINDOW, CW_USEDEFAULT, CW_USEDEFAULT, CW_USEDEFAULT, CW_USEDEFAULT, NULL, NULL, NULL, NULL); | |
| HDC hDC = GetDC(hWnd); |
| // The following code is licensed under the MIT license: https://gist.github.com/TheRealMJP/bc503b0b87b643d3505d41eab8b332ae | |
| // Samples a texture with Catmull-Rom filtering, using 9 texture fetches instead of 16. | |
| // See http://vec3.ca/bicubic-filtering-in-fewer-taps/ for more details | |
| float4 SampleTextureCatmullRom(in Texture2D<float4> tex, in SamplerState linearSampler, in float2 uv, in float2 texSize) | |
| { | |
| // We're going to sample a a 4x4 grid of texels surrounding the target UV coordinate. We'll do this by rounding | |
| // down the sample location to get the exact center of our "starting" texel. The starting texel will be at | |
| // location [1, 1] in the grid, where [0, 0] is the top left corner. | |
| float2 samplePos = uv * texSize; |
| #include <stdio.h> | |
| #include <errno.h> | |
| #include <stdlib.h> | |
| #include <stdint.h> | |
| #include <assert.h> | |
| #include <string.h> | |
| #define streq(a, b) (!strcmp((a), (b))) | |
| #ifndef __USE_GNU | |
| #define __USE_GNU |
| <?xml version="1.0" encoding="UTF-8"?> | |
| <opml version="1.0"> | |
| <head> | |
| <title>Graphics, Games, Programming, and Physics Blogs</title> | |
| </head> | |
| <body> | |
| <outline text="Tech News" title="Tech News"> | |
| <outline type="rss" text="Ars Technica" title="Ars Technica" xmlUrl="http://feeds.arstechnica.com/arstechnica/index/" htmlUrl="https://arstechnica.com"/> | |
| <outline type="rss" text="Polygon - Full" title="Polygon - Full" xmlUrl="http://www.polygon.com/rss/index.xml" htmlUrl="https://www.polygon.com/"/> | |
| <outline type="rss" text="Road to VR" title="Road to VR" xmlUrl="http://www.roadtovr.com/feed" htmlUrl="https://www.roadtovr.com"/> |
This is my little Christmas-break experiment trying to (among other things) reduce the amount of generated code for containers.
THIS CODE WILL CONTAIN BUGS AND IS ONLY PRESENTED AS AN EXAMPLE.
The C++ STL is still an undesirable library for many reasons I have extolled in the past. But it's also a good library. Demons lie in this here debate and I have no interest in revisiting it right now.
The goals that I have achieved with this approach are:
| An Invertible Split Scheme for Cascading Shadow Maps | |
| by Leonard Ritter | |
| Duangle GbR | |
| Second revision: 2016/01/01 | |
| DISCLAIMER: This is original research and has not been verified by a | |
| second or third party yet. |
| #define out OutCatcher() << | |
| template <typename TYPE> struct Out | |
| { | |
| explicit Out(TYPE& ref) : ref(ref) { } | |
| TYPE& ref; | |
| }; | |
| struct OutCatcher | |
| { |
Memory Optimization (Christer Ericson, GDC 2003)
http://realtimecollisiondetection.net/pubs/GDC03_Ericson_Memory_Optimization.ppt
Cache coherency primer (Fabian Giesen)
https://fgiesen.wordpress.com/2014/07/07/cache-coherency/
Code Clinic 2015: How to Write Code the Compiler Can Actually Optimize (Mike Acton)
http://gdcvault.com/play/1021866/Code-Clinic-2015-How-to
| float3 PositionToOctahedron(float3 position) | |
| { | |
| // Normalize input position to unit sphere to simplify required ops | |
| float3 P = normalize(position); | |
| // Get octant index | |
| float3 side = P >= 0 ? 1 : 0; | |
| float octant_index = side.x + side.y * 2 + side.z * 4; | |
| // Project onto octahedron face, then onto each x/y plane |
