test for point inside path

    Mar 07 2009 | 4:49 pm
    Hi there,
    I am using the JGraphics API extensively and I like it a lot.
    However, I have noticed that there is no function call to test if a point is inside an arbitrary path.
    Specifically, there is not even a function to test if a point is inside a circle.
    I know I could use the pt_in_roundedrect function, but it doesn't seem the best way to go, and it is still not usable for an arbitrary path.
    Am I missing something here?
    Thanks in advance.
    - Luigi

    • Mar 10 2009 | 11:41 pm
      Please, how do I test if a point is inside or outside a path?
      - Luigi
    • Aug 11 2011 | 8:46 am
      Hi Luigi!
      I have the same question and I like to know if you have the answer yet.
      Actually I want to do this in svg bezier (path).
    • Aug 11 2011 | 12:31 pm
      Hi Luigi,
      i was looking into this the other day, to save iterating through a big list of screen button coordinates to ascertain where the mouse is pressed. I tried making a tiny rectangle of the ,ouse position and trying
      long jgraphics_rectcontainsrect(t_rect *outer, t_rect *inner);.
      I couldn't get it to work for me, so ended up building a big dictionary of button coordinates to make the iteration a bit easier to follow.
      If you get jgraphics_rectcontainsrect to work for you, let me know how - I've been so full on with building a big gui that I can't even remember what exactly was going wrong!!!!
      All the best,
    • Aug 11 2011 | 1:06 pm
      Hi guys,
      I am not completely sure I understand Leigh's post, however I don't think jgraphics_rectcontainsrect() would be the preferred way to go here. In the JGraphics API there's simply a graphics_ptinrect() function that ought to do what's needed to test if a point is inside a rectangular area.
      If your needs are more complex than that (i.e. test if a point is inside an arbitrary path) here is what I do:
      int pt_in_path(t_pt *pt)
          t_jsurface *surface;
          t_jgraphics *context;
          int result = 0;
          surface = jgraphics_image_surface_create(JGRAPHICS_FORMAT_A8, 1, 1);
          context = jgraphics_create(surface);
           * Here is where you draw your path...
           * Remember to close it by calling jgraphics_close_path() at the end.
          result = jgraphics_in_fill(context, pt->x, pt->y);
          return result;
      Basically you create a 1x1 offscreen surface, get the context associated with that surface and then draw the path.
      Since a path is just a mathematical entity that has nothing to do with pixels, you don't use it for drawing, but you let jgraphics_in_fill() calculate for you if the specified point is inside or outside the path.
      This works... however I am curious if someone found a better/faster approach, that doesn't involve creating a surface.
      - Luigi
    • Aug 11 2011 | 2:42 pm
      this is typical problem in computer graphics.
      search for "inside polygon", the Jordan Curve Theorem algorithm below works by looking at intersecting each line of the polygon.
      here's the function i'm using right now, works quite well:
      bool insidePolygon(point & p)
      	point p1, p2; // p1, p2 = line; p = current
      	float x1, x2;
      	int crossings = 0;
      	float k, m, y2;
      	static const float eps = 0.000001;
      	float dx, dy;
      	// iterate through each line
      	for (int i = 0; i < (numerOfPolyPoints - 1); i++ )
      		p1 = map->perimeter[i].relPosition;
      		p2 = map->perimeter[i+1].relPosition;
      		if ( p1.x < p2.x ) { // same result when going from left to right and right to left
      			x1 = p1.x;
      			x2 = p2.x;
              } else {
      			x1 = p2.x;
      			x2 = p1.x;
              // is ray capable of crossing the line ?
              if ( p.x > x1 && p.x
    • Aug 11 2011 | 3:05 pm
      Sure, but that works only with polygons.
      I was talking about arbitrary paths which could be made of bezier curves as well. [ jgraphics_curve_to() ]
      Thanks for sharing your solution anyway.
      - Luigi
    • Aug 11 2011 | 3:09 pm
      well, a bezier curve has to be rendered, so if you know the resolution, you can get the bezier as line-segments. the path has to be closed, anyways, otherwise a point can't be inside it, right? ;=)
      looks complicated, what are you trying to achieve?
    • Aug 12 2011 | 2:00 pm
      I'd rather use the resolution independent property of paths since it's very desirable for the kind of work I am doing. On top of that, it's flexible, efficient and it integrates nicely with the JGraphics API.
      I am not trying to achieve anything in particular. I always like this kind of geometry problem and - above all - I was trying to answer Leigh's post. In the process I got curious to find out if there was some other approach that could have been better/faster than what I came up with.
      I think that - if you want to use the facilities provided by the JGraphics API - there's not much else that could be done. Maybe if the path struct could be directly accessed by the user more possibilities might be available, but - at least in this version of the SDK - it's not the case...
      Thanks for your input.
      - Luigi