/* This file is part of Mapnik (c++ mapping toolkit) * Copyright (C) 2005 Artem Pavlenko * * Mapnik 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 any later version. * * This program 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 this program; if not, write to the Free Software * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */ //$Id: geom_util.hpp 39 2005-04-10 20:39:53Z pavlenko $ #ifndef GEOM_UTIL_HPP #define GEOM_UTIL_HPP #include namespace mapnik { template bool clip_test(T p,T q,double& tmin,double& tmax) { double r; bool result=true; if (p<0.0) { r=q/p; if (r>tmax) result=false; else if (r>tmin) tmin=r; } else if (p>0.0) { r=q/p; if (r bool clip_line(T& x0,T& y0,T& x1,T& y1,const Image* image) { double tmin=0.0; double tmax=1.0; double dx=x1-x0; if (clip_test(-dx,x0,tmin,tmax)) { if (clip_test(dx,image->width()-x0,tmin,tmax)) { double dy=y1-y0; if (clip_test(-dy,y0,tmin,tmax)) { if (clip_test(dy,image->height()-y0,tmin,tmax)) { if (tmax<1.0) { x1=static_cast(x0+tmax*dx); y1=static_cast(y0+tmax*dy); } if (tmin>0.0) { x0+=static_cast(tmin*dx); y0+=static_cast(tmin*dy); } return true; } } } } return false; } template inline bool point_inside_path(double x,double y,Iter start,Iter end) { bool inside=false; double x0=start->x; double y0=start->y; double x1,y1; while (++start!=end) { if (start->cmd == SEG_MOVETO) { x0=start->x; y0=start->y; continue; } x1=start->x; y1=start->y; if ((((y1 <= y) && (y < y0)) || ((y0 <= y) && (y < y1))) && ( x < (x0 - x1) * (y - y1)/ (y0 - y1) + x1)) inside=!inside; x0=x1; y0=y1; } return inside; } #define TOL 0.00001 /* (Ay-Cy)(Bx-Ax)-(Ax-Cx)(By-Ay) s = ----------------------------- L^2 */ inline bool point_in_circle(double x,double y,double cx,double cy,double r) { double dx = x - cx; double dy = y - cy; double d2 = dx * dx + dy * dy; return (d2 <= r * r); } inline bool point_on_segment(double x,double y,double x0,double y0,double x1,double y1) { double dx = x1 - x0; double dy = y1 - y0; if ( fabs(dx) > TOL || fabs(dy) > TOL ) { double s = (y0 - y) * dx - (x0 - x) * dy; return ( fabs (s) < TOL ) ; } return false; } inline bool point_on_segment2(double x,double y,double x0,double y0,double x1,double y1) { double d = sqrt ((x1 - x0) * (x1 - x0) + (y1 - y0) * (y1 - y0)); double d0 = sqrt ((x0 - x) * (x0 - x) + (y0 - y) * (y0 - y)); double d1 = sqrt ((x1 - x) * (x1 - x) + (y1 - y) * (y1 - y)); double d2 = d0 + d1; return ( d2 - d < 0.01); } #undef TOL template inline bool point_on_path(double x,double y,Iter start,Iter end) { return false; } template inline bool point_on_points (double x,double y,Iter start,Iter end) { return false; } struct filter_in_box { Envelope box_; explicit filter_in_box(const Envelope& box) : box_(box) {} bool pass(const Envelope& extent) const { return extent.intersects(box_); } }; struct filter_at_point { coord2d pt_; explicit filter_at_point(const coord2d& pt) : pt_(pt) {} bool pass(const Envelope& extent) const { return extent.contains(pt_); } }; } #endif //GEOM_UTIL_HPP