Hi, the fast version seems to be specific to connected polygons without holes.
In general, I would try using winding numbers - assuming that by "inside", you mean non-vanishing winding number of a closed path around that point. Experimenting right now... But there must be well tested algorithms. Michael Arnd Baecker venit, vidit, dixit 23.06.2015 08:57: > Hi, > > On Sun, 21 Jun 2015, Aman Bhatia wrote: > >> Hello everyone, >> Is there a way to know if a point lies inside a SVG path or not? Point may >> also be on the path itself, so we should also consider it. > > If you find a way to convert your path into numpy arrays, > maybe you could make use of things discussed here > http://stackoverflow.com/questions/8833950/how-to-determine-which-points-are-inside-of-a-polygon-and-which-are-not-large-n > > (Note: I haven't used anything of that ...). > > Best, Arnd > > ------------------------------------------------------------------------------ > Monitor 25 network devices or servers for free with OpManager! > OpManager is web-based network management software that monitors > network devices and physical & virtual servers, alerts via email & sms > for fault. Monitor 25 devices for free with no restriction. Download now > http://ad.doubleclick.net/ddm/clk/292181274;119417398;o > ------------------------------------------------------------------------------ Monitor 25 network devices or servers for free with OpManager! OpManager is web-based network management software that monitors network devices and physical & virtual servers, alerts via email & sms for fault. Monitor 25 devices for free with no restriction. Download now http://ad.doubleclick.net/ddm/clk/292181274;119417398;o _______________________________________________ PyX-user mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/pyx-user
