RayTracedShadows - GitLite

KO | EN

gitlite — search

#llm #go #rust #deep-learning #macos #java #windows #awesome #cli #vue #awesome-list #pytorch #mcp #openai

RayTracedShadows

(★ 133)

This demo implements BVH construction and GPU traversal for rendering hard shadows.

파일 탐색기

최종 버전 다운로드 (.zip)

- - CMakeLists.txt
  - stb_image.h
  - stb_image_resize.h
- - CMakeLists.txt
  - tiny_obj_loader.cc
  - tiny_obj_loader.h
- - CMakeLists.txt
  - objparser.cpp
  - objparser.h
  - README.md
- CMakeLists.txt
- librush
- cmake-vs2015-vk.cmd
- cmake-vs2017-vk.cmd
- cmake-vs2019-vk.cmd
- cmake-xcode-mtl.sh
- - Blit.vert
  - Combine.frag
  - Model.frag
  - Model.vert
  - RayTracedShadows.comp
  - RayTracedShadows.rgen
  - RayTracedShadows.rmiss
  - RayTracedShadowsInline.comp
- BaseApplication.cpp
- BaseApplication.h
- BVHBuilder.cpp
- BVHBuilder.h
- CMakeLists.txt
- MovingAverage.h
- RayTracedShadows.cpp
- RayTracedShadows.h
- VkRaytracing.cpp
- VkRaytracing.h
.gitignore
.gitmodules
CMakeLists.txt
LICENSE
README.md

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# Ray Traced Shadows

This demo implements BVH construction and GPU traversal for rendering hard shadows.

## BVH Construction and Layout

BVH is constructed on CPU. The build process is fairly naive, but results in a high quality hierarchy that's fast to traverse. The tree is constructed using a top-down strategy, using a surface area heuristic (SAH) to find optimal split point at every level.

Nodes are laid out in memory using a depth-first traversal order. Child node with the larger surface area is always on the left. This heuristic aims to find an intersected primitive for a ray in a cache-coherent manner.

Each intermediate BVH node is packed into 32 bytes:

struct BVHNode
	{
		vec3 bboxMin;
		uint primitiveId;
		vec3 bboxMax;
		uint next;
	};

Leaf BVH nodes are packed into 48 bytes:

struct BVHNodeLeaf
	{
		vec3 edge0;
		uint padding0;
		vec3 edge1;
		uint next; // node miss pointer
		vec3 vertex;
		uint padding2;
	};

## BVH Traversal

Hard shadows are implemented by using any-hit BVH traversal for a ray on GPU. A stackless algorithm is used, which relies on the depth-first memory layout of the tree.

The bounding box of each visited intermediate node is tested against a ray. On hit, the next node that must be visited is next in memory. On miss, current node's `next` pointer is used to skip part of the tree. This either jumps to the current node's right sibling or to the parent's right sibling.

Each intermediate node contains a `primitiveId` field. If this field is not `0xFFFFFFFF`, then current node is reinterpreted as `BVHNodeLeaf`. Extra data for leaf nodes is stored deinterleaved (at the end of the BVH buffer).

## How to build on Windows with Visual Studio 2017

Clone repository

git@github.com:kayru/RayTracedShadows.git
	cd RayTracedShadows
	git submodule update --init

Generate Visual Studio solution

cd Scripts
	cmake-vs2017-vk.cmd

Solution files written to `Build` directory in the root of the repository.

## Acknowledgements

This demo uses similar ideas to what is described in the following work:

* [The Perfect BVH, Jacco Bikker, 2016](http://www.cs.uu.nl/docs/vakken/magr/2015-2016/slides/lecture%2003%20-%20the%20perfect%20BVH.pdf)
* [Implementing a practical rendering system using GLSL, Toshiya Hachisuka, 2015](http://www.ci.i.u-tokyo.ac.jp/~hachisuka/tdf2015.pdf)
* [AMD RadeonRays](https://github.com/GPUOpen-LibrariesAndSDKs/RadeonRays_SDK)