From 5da54c2210d48067e654ebd3fc9fc8163836d60a Mon Sep 17 00:00:00 2001 From: Yann Herklotz Grave Date: Thu, 28 Mar 2019 18:21:37 +0000 Subject: Add median cut --- README.md | 9 +++++++++ 1 file changed, 9 insertions(+) diff --git a/README.md b/README.md index fb61f15..00ccb39 100644 --- a/README.md +++ b/README.md @@ -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. + +![median cut](/data/median_cut6.jpg) + ## Build and run To compile and run, one has to first download -- cgit