From 29bc06efc9e63b9a043fc1182d49bd53206070d1 Mon Sep 17 00:00:00 2001 From: ExUtumno Date: Mon, 24 Jul 2017 22:30:08 +0300 Subject: [PATCH] our -> my --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 6f7e003..20b58cb 100644 --- a/README.md +++ b/README.md @@ -6,7 +6,7 @@ The algorithms are: 2. K-coherent neighbourhood search of [Michael Ashikhmin](http://www.cs.princeton.edu/courses/archive/fall10/cos526/papers/ashikhmin01a.pdf) and [Xin Tong + Jingdan Zhangz + Ligang Liu + Xi Wangz + Baining Guo + Heung-Yeung Shum](http://research.microsoft.com/pubs/65191/btfsynthesis.pdf) takes computational burden from the synthesis to the analysis part and therefore is better suited for synthesizing large textures. 3. Resynthesis algorithm of [P. F. Harrison](http://logarithmic.net/pfh-files/thesis/dissertation.pdf) is scale-invariant, fast, supports constraints and practically never produces completely unsatisfactory results. -Note that our implementations are not completely true to the original papers. +Note that my implementations are not completely true to the original papers. Watch a video demonstration of P. F. Harrison's algorithm on YouTube: [https://www.youtube.com/watch?v=8sUMBMpZNzk](https://www.youtube.com/watch?v=8sUMBMpZNzk).