| // float->half variants. | |
| // by Fabian "ryg" Giesen. | |
| // | |
| // I hereby place this code in the public domain, as per the terms of the | |
| // CC0 license: | |
| // | |
| // https://creativecommons.org/publicdomain/zero/1.0/ | |
| // | |
| // float_to_half_full: This is basically the ISPC stdlib code, except | |
| // I preserve the sign of NaNs (any good reason not to?) |
I just had to set up Jenkins to use GitHub. My notes (to myself, mostly):
For setting up Jenkins to build GitHub projects. This assumes some ability to manage Jenkins, use the command line, set up a utility LDAP account, etc. Please share or improve this Gist as needed.
| using System.IO; | |
| using Microsoft.Build.Utilities; | |
| namespace TestFileTracker | |
| { | |
| class Program | |
| { | |
| static void Main(string[] args) | |
| { |
| #include "hemicube.h" | |
| #define PACK_HEMICUBES 1 | |
| static void get_hemicube_face_normal(int index, Vector3 *forward, Vector3 *left, Vector3 *up) { | |
| // Unwrapped hemicube with positive-Z in the middle. | |
| switch (index) { | |
| case 0: *forward = Vector3(+1, 0, 0); *left = Vector3( 0, 1, 0); break; |
| <?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"/> |
| A Basic Introduction to BRDF-Based Lighting [RECOMMANED] | |
| https://www.cs.princeton.edu/courses/archive/fall06/cos526/tmp/wynn.pdf | |
| A Reflectance Model for Computer Graphics | |
| http://www.graphics.cornell.edu/~westin/consortium-home/cook-tog.pdf | |
| SIGGRAPH 2012 Course: Practical Physically Based Shading in Film and Game Production | |
| http://blog.selfshadow.com/publications/s2012-shading-course/#course_content | |
| SIGGRAPH 2013 Course: Physically Based Shading in Theory and Practice |
| // NOTE: Must bind 8x single mip RWTexture views, because HLSL doesn't have .mips member for RWTexture2D. (SRVs only have .mips member) | |
| // NOTE: globallycoherent attribute is needed. Without it writes aren't guaranteed to be seen by other groups | |
| globallycoherent RWTexture2D<float> MipTextures[8]; | |
| RWTexture2D<uint> Counters[8]; | |
| groupshared uint CounterReturnLDS; | |
| [numthreads(16, 16, 1)] | |
| void GenerateMipPyramid(uint3 Tid : SV_DispatchThreadID, uint3 Group : SV_GroupId, uint Gix : SV_GroupIndex) | |
| { | |
| [unroll] |
| Algorithms used for Cone* preprocess the mesh in some way, then split sequentially into 64-triangle clusters: | |
| ConeBase: optimize mesh for transform cache | |
| ConeSort: split mesh into large planar connected clusters, bin clusters into 6 buckets by cardinal axes, optimize each bucket for transform cache | |
| ConeAcmr: optimize mesh for transform cache, split sequentially into variable length clusters that are relatively planar, sort clusters by avg normal | |
| ConeCash: optimize mesh for transform cache, picking triangles that reduce ACMR but prioritizing those that keep current cluster planar | |
| MaskBase: split sequentially into 64-triangle clusters, store a 64-bit conservative triangle mask for 6 frustums (cube faces) | |
| ManyConeN: split sequentially into 64-triangle clusters, store N (up to 4) cones for each cluster and a cone id per triangle (2 bit) | |
| Note that all Cone* solutions get significantly worse results with 128 or 256 triangle clusters; it doesn't matter much for Mask. | |
| The biggest challenge with Cone* algorithms is t |
| 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)] |
| // | |
| // C++ implementaion of "A simple method to construct isotropic quasirandom blue | |
| // noise point sequences" | |
| // | |
| // http://extremelearning.com.au/a-simple-method-to-construct-isotropic-quasirandom-blue-noise-point-sequences/ | |
| // | |
| // Assume 0 <= x | |
| static double myfmod(double x) { return x - std::floor(x); } |
