nearest-point.cpp revision d02f89424319afe28fe2cc6696c28108448de3ac
/*
* nearest point routines for D2<SBasis> and Piecewise<D2<SBasis>>
*
* Authors:
*
* Marco Cecchetti <mrcekets at gmail.com>
*
* Copyright 2007-2008 authors
*
* modify it either under the terms of the GNU Lesser General Public
* License version 2.1 as published by the Free Software Foundation
* (the "LGPL") or, at your option, under the terms of the Mozilla
* Public License Version 1.1 (the "MPL"). If you do not alter this
* notice, a recipient may use your version of this file under either
* the MPL or the LGPL.
*
* You should have received a copy of the LGPL along with this library
* in the file COPYING-LGPL-2.1; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
* You should have received a copy of the MPL along with this library
* in the file COPYING-MPL-1.1
*
* The contents of this file are subject to the Mozilla Public License
* Version 1.1 (the "License"); you may not use this file except in
* compliance with the License. You may obtain a copy of the License at
*
* This software is distributed on an "AS IS" basis, WITHOUT WARRANTY
* OF ANY KIND, either express or implied. See the LGPL or the MPL for
* the specific language governing rights and limitations.
*/
#include "nearest-point.h"
namespace Geom
{
////////////////////////////////////////////////////////////////////////////////
// D2<SBasis> versions
/*
* Return the parameter t of a nearest point on the portion of the curve "c",
* related to the interval [from, to], to the point "p".
* The needed curve derivative "dc" is passed as parameter.
* The function return the first nearest point to "p" that is found.
*/
double nearest_point( Point const& p,
{
{
THROW_RANGEERROR("[from,to] interval out of bounds");
}
double distsq;
{
{
}
}
return closest;
}
/*
* Return the parameters t of all the nearest points on the portion of
* the curve "c", related to the interval [from, to], to the point "p".
* The needed curve derivative "dc" is passed as parameter.
*/
all_nearest_points( Point const& p,
{
{
THROW_RANGEERROR("[from,to] interval out of bounds");
}
for ( unsigned int i = 0; i < candidates.size(); ++i )
{
}
unsigned int closest = 0;
{
{
closest = i;
}
}
for ( unsigned int i = 0; i < candidates.size(); ++i )
{
{
}
}
return result;
}
////////////////////////////////////////////////////////////////////////////////
// Piecewise< D2<SBasis> > versions
double nearest_point( Point const& p,
{
{
THROW_RANGEERROR("[from,to] interval out of bounds");
}
{
double nearest=
}
double t;
double dsq;
{
bb = bounds_fast(c[i]);
t = nearest_point(p, c[i]);
dsq = distanceSq(p, c[i](t));
{
nearest = t;
ni = i;
}
}
{
{
nearest = t;
}
}
}
all_nearest_points( Point const& p,
{
{
THROW_RANGEERROR("[from,to] interval out of bounds");
}
{
for ( unsigned int i = 0; i < all_nearest.size(); ++i )
{
}
return all_nearest;
}
double dsq;
{
bb = bounds_fast(c[i]);
all_t = all_nearest_points(p, c[i]);
{
}
{
}
}
{
{
{
}
return all_t;
}
{
}
}
{
{
}
}
return all_nearest;
}
} // end namespace Geom