--------------------------------------------------------------------------------
--------------------------------------------------------------------------------

AUTHOR:     Thomas Diewald

Date:       24.03.2013

website:    www.thomasdiewald.com

--------------------------------------------------------------------------------
--------------------------------------------------------------------------------



################################################################################
--------------------------------------------------------------------------------
WebGL/JavaScript  - KdTree Nearest neighbor Search  - GL ES
--------------------------------------------------------------------------------
################################################################################


blog-post:   http://thomasdiewald.com/blog/?p=1825
online-demo: http://thomasdiewald.com/javascript/webgl/PixelVoronoi_KdTree_v05/


Kd-Tree Nearest Neighbor Search.
For each pixel, the distance to the nearest neighbor is stored in a 
"distance-map", which results in a voronoi-diagram.
The NNS is done in the fragment shader. The kdTree is build in javascript.



 * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
 *
 *
 * (c) thomas diewald
 *
 *
 * This source is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 * 
 * This code is distributed in the hope that it will be useful, but
 * WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * General Public License for more details.
 * 
 * A copy of the GNU General Public License is available on the World
 * Wide Web at <http://www.gnu.org/copyleft/gpl.html>. You can also
 * obtain it by writing to the Free Software Foundation,
 * Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
 *
 *
 * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *