$search

QuadrilateralOps.cc

Go to the documentation of this file.

#include <art_map/types.h>
#include <art_observers/QuadrilateralOps.h>
#include <art_map/PolyOps.h> 

namespace quad_ops {
// determines if point lies in interior of given polygon points on
  // edge segments are considered interior points
  bool pointInHull(float x, float y, const geometry_msgs::Point32 *p1, const geometry_msgs::Point32 *p2, const geometry_msgs::Point32 *p3, const geometry_msgs::Point32 *p4) {
    float minx=p1->x;
    float maxx=p1->x;
    float miny=p1->y;
    float maxy=p1->y;
    
    minx=fminf(fminf(fminf(minx,p2->x),p3->x),p4->x);
    miny=fminf(fminf(fminf(miny,p2->y),p3->y),p4->y);
    maxx=fmaxf(fmaxf(fmaxf(maxx,p2->x),p3->x),p4->x);
    maxy=fmaxf(fmaxf(fmaxf(maxy,p2->y),p3->y),p4->y);

    return (Epsilon::gte(x,minx) && Epsilon::lte(x,maxx) &&
            Epsilon::gte(y,miny) && Epsilon::lte(y,maxy));
  }

  // Determines in a point inside the ArtQuadrilateral. I called it quick
  // as I'm not checking the edges, so we could miss a small percentage
  // of points.
  bool quickPointInPoly(float x, float y, const art_msgs::ArtQuadrilateral& p) {
    const geometry_msgs::Point32 *p1 = &p.poly.points[0];
    const geometry_msgs::Point32 *p2 = &p.poly.points[1];
    const geometry_msgs::Point32 *p3 = &p.poly.points[2];
    const geometry_msgs::Point32 *p4 = &p.poly.points[3];

    if (!pointInHull(x,y,p1,p2,p3,p4))
      return false;
    
    bool odd = false;
    
    // this is an unrolled version of the standard point-in-polygon algorithm

    if ((p1->y < y && p2->y >= y) || (p2->y < y && p1->y >= y))
      if (p1->x + (y-p1->y)/(p2->y-p1->y)*(p2->x-p1->x) < x)
        odd = !odd;
    
    if ((p2->y < y && p3->y >= y) || (p3->y < y && p2->y >= y))
      if (p2->x + (y-p2->y)/(p3->y-p2->y)*(p3->x-p2->x) < x)
        odd = !odd;
    
    if ((p3->y < y && p4->y >= y) || (p4->y < y && p3->y >= y))
      if (p3->x + (y-p3->y)/(p4->y-p3->y)*(p4->x-p3->x) < x)
        odd = !odd;
    
    if ((p4->y < y && p1->y >= y) || (p1->y < y && p4->y >= y))
      if (p4->x + (y-p4->y)/(p1->y-p4->y)*(p1->x-p4->x) < x)
        odd = !odd;
    
    if (odd)
      return true;

    return false;
  }

  // Unrolled version on pointInPoly, but this time it only checks then inner
  // 'ratio' percentage of the polygon.
  bool quickPointInPolyRatio(float x, float y, const art_msgs::ArtQuadrilateral& p, float ratio) {
    const float diff=(1-ratio)/2;
 
    geometry_msgs::Point32 p1 = p.poly.points[0];
    geometry_msgs::Point32 p2 = p.poly.points[1];
    geometry_msgs::Point32 p3 = p.poly.points[2];
    geometry_msgs::Point32 p4  = p.poly.points[3];

    // Ratio reduction  
    p1.x=p1.x+(p4.x-p1.x)*diff;
    p4.x=p1.x+(p4.x-p1.x)*(1-diff);
    p1.y=p1.y+(p4.y-p1.y)*diff;
    p4.y=p1.y+(p4.y-p1.y)*(1-diff);     

    p2.x=p2.x+(p3.x-p2.x)*diff;
    p3.x=p2.x+(p3.x-p2.x)*(1-diff);
    p2.y=p2.y+(p3.y-p2.y)*diff;
    p3.y=p2.y+(p3.y-p2.y)*(1-diff);

    // Normal checks
    if (!pointInHull(x,y,&p1,&p2,&p3,&p4))
      return false;
    
    bool odd = false;
    
    // this is an unrolled version of the standard point-in-polygon algorithm

    if ((p1.y < y && p2.y >= y) || (p2.y < y && p1.y >= y))
      if (p1.x + (y-p1.y)/(p2.y-p1.y)*(p2.x-p1.x) < x)
        odd = !odd;
    
    if ((p2.y < y && p3.y >= y) || (p3.y < y && p2.y >= y))
      if (p2.x + (y-p2.y)/(p3.y-p2.y)*(p3.x-p2.x) < x)
        odd = !odd;
    
    if ((p3.y < y && p4.y >= y) || (p4.y < y && p3.y >= y))
      if (p3.x + (y-p3.y)/(p4.y-p3.y)*(p4.x-p3.x) < x)
        odd = !odd;
    
    if ((p4.y < y && p1.y >= y) || (p1.y < y && p4.y >= y))
      if (p4.x + (y-p4.y)/(p1.y-p4.y)*(p1.x-p4.x) < x)
        odd = !odd;
    
    if (odd)
      return true;

    return false;
  }
  
  // This function returns an ArtLanes containing all the
  // ArtQuadrilaterals in 'quads' that are satisfied by the 'filter'
  // being passed in
  art_msgs::ArtLanes filterLanes(const art_msgs::ArtQuadrilateral& base_quad,
                                 const art_msgs::ArtLanes& quads,
                                 bool(*filter)(const art_msgs::ArtQuadrilateral&, const art_msgs::ArtQuadrilateral&))
  {
    art_msgs::ArtLanes filtered;
    size_t num_quads = quads.polygons.size();
    for (size_t i=0; i<num_quads; i++) {
      const art_msgs::ArtQuadrilateral* p= &(quads.polygons[i]);
      if (filter(base_quad,quads.polygons[i]))  {
        filtered.polygons.push_back(*p);
      }
    }
    return filtered;
  }
  
  // This function returns an ArtLanes containing all the 
  // ArtQuadrilaterals in 'quads' that are in the adjacent lane
  art_msgs::ArtLanes filterAdjacentLanes(MapPose &pose,
                                 const art_msgs::ArtLanes& quads,
                                 const int lane)
  {
    PolyOps polyOps;
    poly_list_t allPolygons, to_polys;
    polyOps.GetPolys(quads, allPolygons);
    polyOps.getLaneDir(allPolygons, to_polys, 0, lane, pose);
    art_msgs::ArtLanes adjacentPolys;
    polyOps.GetLanes(to_polys, adjacentPolys);
    return adjacentPolys;
    
  }
}

---

art_observers
Author(s): Michael Quinlan, Jack O'Quin, Corbyn Salisbury
autogenerated on Fri Mar 1 14:13:51 2013