/*****************************************************************************
 * Copyright 2005 Kevin Hobbs <hobbsk@ohiou.edu>                             *
 *                                                                           *
 * This file is part of Balloon.                                             *
 *                                                                           *
 * Balloon 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.                                       *
 *                                                                           *
 * Balloon 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.                              *
 *                                                                           *
 * You should have received a copy of the GNU General Public License         *
 * along with Balloon; if not, write to the Free Software                    *
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA *
 *****************************************************************************/


#include<stdio.h>
#include <math.h>
#include "mesh.h"
#include "balloon.h"


int long_segment(
		const struct point ** balloon, 
		const size_t num_points,
		const double * s0,
		const size_t ndims,
		struct point ** p1, 
		struct point ** p2 )
{
	size_t i, j, k;
	double l;
	double longest = 0;
	int stat = 0;

	for (i = 0; i < num_points; i++)
		for ( j = 0; j < balloon[i]->neighbor_count; j++)
			for ( k = 0; k < ndims; k++)
			{
				l = 
					balloon[i]->x_in[k] 
					- balloon[i]->neighbors[j]->x_in[k];
				l = fabs(l);
							
				if ((l > s0[k]) && (l > longest))
				{
					longest = l;
					*p1 = balloon[i];
					*p2 = balloon[i]->neighbors[j];
					stat = STILL_LONG;
				}
			}
	return stat;
}