AlgoMesh1d.java

/* jCAE stand for Java Computer Aided Engineering. Features are : Small CAD
   modeler, Finite element mesher, Plugin architecture.
 
    Copyright (C) 2003,2004,2005,2006, by EADS CRC
    Copyright (C) 2007,2008,2009, 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.bora.algo;

import org.jcae.mesh.amibe.algos1d.UniformLength;
import org.jcae.mesh.amibe.algos1d.UniformLengthDeflection;
import org.jcae.mesh.amibe.ds.MMesh1D;
import org.jcae.mesh.amibe.ds.SubMesh1D;
import org.jcae.mesh.bora.ds.BDiscretization;

import java.util.HashMap;
import java.util.logging.Logger;

/**
 * Computes a new discretization of the edges using the local definition
 * of target length and target deflection for each edge.
 */
public class AlgoMesh1d
{
	private static final Logger LOGGER = Logger.getLogger(AlgoMesh1d.class.getName());

	private final MMesh1D mesh1d;
	
	/**
	 * Creates a <code>AlgoMesh1d</code> instance.
	 *
	 * @param m  the <code>MMesh1D</code> instance to mesh.
	 */
	public AlgoMesh1d(MMesh1D m)
	{
		mesh1d = m;
	}

	/**
	 * Explores each edge discretization of the mesh and calls the 
	 * discretisation method.
	 */
	public void compute(boolean relDefl)
	{
		int nbTEdges = 0, nbNodes = 0, nbEdges = 0;
		double currentDiscrLength;
		double currentDiscrDeflec;
		/*  First compute current nbNodes and nbEdges  */
		for (BDiscretization discrE : mesh1d.getBEdges())
		{
			SubMesh1D submesh1d = mesh1d.getSubMesh1DFromMap(discrE);
			nbNodes += submesh1d.getNodes().size();
			nbEdges += submesh1d.getEdges().size();
		}
		/* Explore the shape for each edge */
		for (BDiscretization discrE : mesh1d.getBEdges())
		{
			SubMesh1D submesh1d = mesh1d.getSubMesh1DFromMap(discrE);
			nbNodes -= submesh1d.getNodes().size();
			nbEdges -= submesh1d.getEdges().size();

			currentDiscrLength = discrE.getConstraint().getHypothesis().getLength();
			currentDiscrDeflec = discrE.getConstraint().getHypothesis().getDeflection();
			HashMap<String, String> options1d = new HashMap<String, String>();
			options1d.put("size", Double.toString(currentDiscrLength));
			options1d.put("deflection", Double.toString(currentDiscrDeflec));
			options1d.put("relativeDeflection", Boolean.toString(relDefl));

			if (currentDiscrDeflec <= 0.0)
			{
				if (new UniformLength(mesh1d, options1d).computeEdge(submesh1d))
					nbTEdges++;
			}
			else
			{
				if (new UniformLengthDeflection(mesh1d, options1d).computeEdge(submesh1d))
				{
					nbTEdges++;
					// Feature not available yet!
 					// if (isotropic)
 					// 	algoCompat1D2D.computeEdge(submesh1d, Set faceset, currentDiscrDeflec, relDefl);
					// The computation of faceset still has to be done.
				}
			}
			nbNodes += submesh1d.getNodes().size();
			nbEdges += submesh1d.getEdges().size();
			System.out.println(discrE+": nbNodes = "+submesh1d.getNodes().size()+" nbEdges = "+submesh1d.getEdges().size());
		}
		LOGGER.fine("TopoEdges discretisees "+nbTEdges);
		LOGGER.fine("Edges   "+nbEdges);
		LOGGER.fine("Nodes   "+nbNodes);
		assert(mesh1d.isValid());
	}

}