To remove a submodule you need to:
| # Simulator for depth comparison error (i.e. z-fighting) | |
| # Nathan Reed, June 2015 | |
| # Written for Python 3.4; requires numpy | |
| import math | |
| import numpy as np | |
| import optparse | |
| # Parse command-line options | |
| parser = optparse.OptionParser() |
| #include <algorithm> | |
| #include <iostream> | |
| #include <string> | |
| #ifdef _WIN32 | |
| #include <limits.h> | |
| #include <intrin.h> | |
| typedef unsigned __int32 uint32_t; | |
| #else | |
| #include <stdint.h> |
This article is also available here
Orthodox C++ (sometimes referred as C+) is minimal subset of C++ that improves C, but avoids all unnecessary things from so called Modern C++. It's exactly opposite of what Modern C++ suppose to be.
| Overview | |
| * http://behindthepixels.io/assets/files/TemporalAA.pdf | |
| * https://www.highperformancegraphics.org/wp-content/uploads/2017/Retrospective/HPG2017_Jimenez_MLAARetrospective.pdf | |
| UE4 | |
| * http://advances.realtimerendering.com/s2014/epic/TemporalAA.pptx | |
| INSIDE | |
| * https://github.com/playdeadgames/temporal/blob/master/GDC2016_Temporal_Reprojection_AA_INSIDE.pdf |
| /*============================================================================ | |
| NVIDIA FXAA 3.11 by TIMOTHY LOTTES | |
| ------------------------------------------------------------------------------ | |
| COPYRIGHT (C) 2010, 2011 NVIDIA CORPORATION. ALL RIGHTS RESERVED. | |
| ------------------------------------------------------------------------------ | |
| TO THE MAXIMUM EXTENT PERMITTED BY APPLICABLE LAW, THIS SOFTWARE IS PROVIDED |
| // The MIT License (MIT) | |
| // Copyright (c) 2018 cmf028 | |
| // Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: | |
| // The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. | |
| // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH |
| In shader programming, you often run into a problem where you want to iterate an array in memory over all pixels in a compute shader | |
| group (tile). Tiled deferred lighting is the most common case. 8x8 tile loops over a light list culled for that tile. | |
| Simplified HLSL code looks like this: | |
| Buffer<float4> lightDatas; | |
| Texture2D<uint2> lightStartCounts; | |
| RWTexture2D<float4> output; | |
| [numthreads(8, 8, 1)] |
Adding extra probes around walls (detroit become human)
Offset along "bent normal"
Approximate probe-visibility with cubemap (causes "shadowmap"-like artefacts), DDGI, McGuire