QuadTreeSampleNearest.java

/* jCAE stand for Java Computer Aided Engineering. Features are : Small CAD
   modeler, Finite element mesher, Plugin architecture.

    Copyright (C) 2004,2005,2006, by EADS CRC
    Copyright (C) 2008, by EADS France

    This library is free software; you can redistribute it and/or
    modify it under the terms of the GNU Lesser General Public
    License as published by the Free Software Foundation; either
    version 2.1 of the License, or (at your option) any later version.

    This library 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
    Lesser General Public License for more details.

    You should have received a copy of the GNU Lesser General Public
    License along with this library; if not, write to the Free Software
    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA */

package org.jcae.mesh.amibe.patch;

import org.jcae.mesh.amibe.metrics.KdTree;

import java.util.Random;
import java.util.logging.Logger;
import org.jcae.mesh.amibe.metrics.Metric;

/**
 * Unit test to check detection of near vertices.
 * Run
 * <pre>
 *   QuadTreeSampleNearest
 * </pre>
 * to display an initial <code>QuadTree</code> with 500 vertices.
 * When clicking at a point, a yellow segment is displayed between this point
 * and the nearest point found in the same cell, returned by
 * {@link org.jcae.mesh.amibe.metrics.KdTree#getNearVertex}.
 * If {@link org.jcae.mesh.amibe.metrics.KdTree#getNearestVertex}
 * finds a nearest point, a blue segment is displayed.
 */
public class QuadTreeSampleNearest extends QuadTreeSample
{
	private static final Logger logger=Logger.getLogger(QuadTreeSampleNearest.class.getName());
	
	private QuadTreeSampleNearest(KdTree q)
	{
		super (q);
	}
	
	final Vertex2D getNearVertex(Metric metric, double[] uv)
	{
		return (Vertex2D) quadtree.getNearVertex(metric, uv);
	}

	final Vertex2D getNearestVertex(Metric metric, double[] uv)
	{
		return (Vertex2D) quadtree.getNearestVertex(metric, uv);
	}

	public static void main(String args[])
	{
		boolean visu = true;
		Random rand = new Random(113L);
		double [] bbmin = { 0.0, 0.0 };
		double [] bbmax = { 1.0, 1.0 };
		double [] uv = new double[2];
		final Mesh2D m = new Mesh2D();
		final EuclidianMetric2D metric = new EuclidianMetric2D();
		m.pushCompGeom(2);
		m.resetKdTree(bbmin, bbmax);
		final QuadTreeSampleNearest r = new QuadTreeSampleNearest(m.getKdTree());
		logger.fine("Start insertion");
		for (int i = 0; i < 500; i++)
		{
			uv[0] = rand.nextDouble();
			uv[1] = rand.nextDouble();
			Vertex2D pt = (Vertex2D) m.createVertex(uv);
			r.quadtree.add(pt);
		}
		//CheckCoordProcedure checkproc = new CheckCoordProcedure();
		//r.walk(checkproc);
		
		final Viewer view=new Viewer();
		if (visu)
		{
			view.addBranchGroup(r.bgQuadTree());
			view.zoomTo(); 
			view.setVisible(true);
			view.addBranchGroup(r.bgVertices());
			view.setVisible(true);
		}
		
		for (int i = 0; i < 10; i++)
		{
			uv[0] = rand.nextDouble();
			uv[1] = rand.nextDouble();
			if (visu)
			{
				view.addBranchGroup(r.segment(uv, r.getNearVertex(metric, uv).getUV(), 5.0f, 1, 1, 0));
				view.setVisible(true);
				view.addBranchGroup(r.segment(uv, r.getNearestVertex(metric, uv).getUV(), 0.0f, 0, 1, 1));
				view.setVisible(true);
			}
			else
			{
				r.getNearVertex(metric, uv);
				r.getNearestVertex(metric, uv);
			}
		}
		if (visu)
		{
			view.callBack=new Runnable()
			{
				public void run()
				{
					double [] xyz = view.getLastClick();
					if (null != xyz)
					{
						view.addBranchGroup(r.segment(xyz, r.getNearVertex(metric, xyz).getUV(), 5.0f, 1, 1, 0));
						view.setVisible(true);
						view.addBranchGroup(r.segment(xyz, r.getNearestVertex(metric, xyz).getUV(), 0.0f, 0, 1, 1));
						view.setVisible(true);
					}
				}
			};
			view.setVisible(true);
		}
	}
}