diff options
| author | Yann Herklotz Grave <git@yannherklotzgrave.com> | 2019-03-28 18:21:37 +0000 |
|---|---|---|
| committer | Yann Herklotz Grave <git@yannherklotzgrave.com> | 2019-03-28 18:21:37 +0000 |
| commit | 5da54c2210d48067e654ebd3fc9fc8163836d60a (patch) | |
| tree | 47f2729dd44db1fcfdc00c8727894ea26b3f8b25 | |
| parent | 94fac63514218ccc4dde7b37b6a8b066e2cf6589 (diff) | |
| download | median-cut-5da54c2210d48067e654ebd3fc9fc8163836d60a.tar.gz median-cut-5da54c2210d48067e654ebd3fc9fc8163836d60a.zip | |
Add median cut
| -rw-r--r-- | README.md | 9 |
1 files changed, 9 insertions, 0 deletions
@@ -1,5 +1,14 @@ # Median Cut +The median cut algorithm is a method to deterministically sample an environment +map. This is achieved by splitting the environment map along the longest +dimension so that there is equal energy in both halves. This is repeated _n_ +times recursively in each partition. Once there have been _n_ iterations, the +lights are placed in the centroid of each region. Below is an example with 6 +splits, meaning there are 2^6 = 64 partitions. + + + ## Build and run To compile and run, one has to first download |