Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
master
GraphicAlgorithm
540
issues
2
pull requests
549
files
1
active branch
×
CodeFactor Rating B+
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
021_Real-time indirect illumination by virtual planar area lights\CustomGUI.h
0
1
3
A
021_Real-time indirect illumination by virtual planar area lights\CustomGUI.cpp
4
1
-
A
021_Real-time indirect illumination by virtual planar area lights\CalculateWeightPass.h
0
1
2
A
021_Real-time indirect illumination by virtual planar area lights\CalculateWeightPass.cpp
4
1
1
A
021_Real-time indirect illumination by virtual planar area lights\CalculatePlanePass.h
0
1
2
A
021_Real-time indirect illumination by virtual planar area lights\CalculatePlanePass.cpp
4
1
1
A
021_Real-time indirect illumination by virtual planar area lights\CalculateEigenPass.h
0
1
2
A
021_Real-time indirect illumination by virtual planar area lights\CalculateEigenPass.cpp
4
1
1
A
020_Real-time Approximation to Large Convolution Kernel\main.cpp
1
1
-
A
020_Real-time Approximation to Large Convolution Kernel\SponzaGBufferPass.h
0
1
2
A
020_Real-time Approximation to Large Convolution Kernel\SponzaGBufferPass.cpp
4
3
-
A
020_Real-time Approximation to Large Convolution Kernel\Sponza.h
0
1
2
A
020_Real-time Approximation to Large Convolution Kernel\Sponza.cpp
3
2
2
A
020_Real-time Approximation to Large Convolution Kernel\ScreenQuadPass.h
0
1
2
A
020_Real-time Approximation to Large Convolution Kernel\ScreenQuadPass.cpp
4
2
-
A
020_Real-time Approximation to Large Convolution Kernel\NonuniformBlurPass.h
0
1
2
A
020_Real-time Approximation to Large Convolution Kernel\NonuniformBlurPass.cpp
5
1
1
A
019_A Survey of Efficient Representations for Independent Unit Vectors\main.cpp
1
1
-
A
019_A Survey of Efficient Representations for Independent Unit Vectors\EncodePass.h
0
1
2
A
019_A Survey of Efficient Representations for Independent Unit Vectors\EncodePass.cpp
5
2
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!