basic-intersection.h revision 36d9047104b5881ca587a71ade77b1f21d083bc4
/**
* @file
* Basic intersection routines.
*/
/*
* Authors:
* ? <?@?.?>
*
* Copyright ?-? authors
*
* This library is free software; you can redistribute it and/or
* 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
* http://www.mozilla.org/MPL/
*
* 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.
*
*/
#ifndef SEEN_GEOM_BASICINTERSECTION_H
#define SEEN_GEOM_BASICINTERSECTION_H
#include <2geom/point.h>
#include <2geom/sbasis.h>
#include <2geom/d2.h>
#include <vector>
#include <utility>
#define USE_RECURSIVE_INTERSECTOR 0
namespace Geom {
//why not allowing precision to be set here?
void find_intersections(std::vector<std::pair<double, double> >& xs,
D2<SBasis> const & A,
D2<SBasis> const & B);
void find_intersections(std::vector< std::pair<double, double> > & xs,
std::vector<Point> const& A,
std::vector<Point> const& B,
double precision = 1e-5);
//why not allowing precision to be set here?
void find_self_intersections(std::vector<std::pair<double, double> >& xs,
D2<SBasis> const & A);
//--not implemented
//void find_self_intersections(std::vector<std::pair<double, double> >& xs,
// std::vector<Point> const & A);
//TODO: this should be moved to .cpp, shouldn't it?
// #ifdef USE_RECURSIVE_INTERSECTOR
// /*
// * find_intersection
// *
// * input: A, B - set of control points of two Bezier curve
// * input: precision - required precision of computation
// * output: xs - set of pairs of parameter values
// * at which crossing happens
// */
// void find_intersections_bezier_recursive (std::vector< std::pair<double, double> > & xs,
// std::vector<Point> const& A,
// std::vector<Point> const& B,
// double precision = 1e-5);
// #else
/*
* find_intersection
*
* input: A, B - set of control points of two Bezier curve
* input: precision - required precision of computation
* output: xs - set of pairs of parameter values
* at which crossing happens
*
* This routine is based on the Bezier Clipping Algorithm,
* see: Sederberg, Nishita, 1990 - Curve intersection using Bezier clipping
*/
void find_intersections_bezier_clipping (std::vector< std::pair<double, double> > & xs,
std::vector<Point> const& A,
std::vector<Point> const& B,
double precision = 1e-5);
//#endif
/*
* find_collinear_normal
*
* input: A, B - set of control points of two Bezier curve
* input: precision - required precision of computation
* output: xs - set of pairs of parameter values
* at which there are collinear normals
*
* This routine is based on the Bezier Clipping Algorithm,
* see: Sederberg, Nishita, 1990 - Curve intersection using Bezier clipping
*/
void find_collinear_normal (std::vector< std::pair<double, double> >& xs,
std::vector<Point> const& A,
std::vector<Point> const& B,
double precision = 1e-5);
void polish_intersections(std::vector<std::pair<double, double> > &xs,
D2<SBasis> const &A,
D2<SBasis> const &B);
/**
* Compute the Hausdorf distance from A to B only.
*/
double hausdorfl(D2<SBasis>& A, D2<SBasis> const& B,
double m_precision,
double *a_t=0, double* b_t=0);
/**
* Compute the symmetric Hausdorf distance.
*/
double hausdorf(D2<SBasis>& A, D2<SBasis> const& B,
double m_precision,
double *a_t=0, double* b_t=0);
}
#endif // !SEEN_GEOM_BASICINTERSECTION_H
/*
Local Variables:
mode:c++
c-file-style:"stroustrup"
c-file-offsets:((innamespace . 0)(inline-open . 0)(case-label . +))
indent-tabs-mode:nil
fill-column:99
End:
*/
// vim: filetype=cpp:expandtab:shiftwidth=4:tabstop=8:softtabstop=4:fileencoding=utf-8:textwidth=99 :