[Numpy-discussion] Stick intersection path algorithm
Chris Barker - NOAA Federal
chris.barker at noaa.gov
Sun Sep 1 20:18:04 EDT 2013
On Sun, Sep 1, 2013 at 3:55 PM, Josè Luis Mietta <
joseluismietta at yahoo.com.ar> wrote:
> Given two arbitrary sticks, i need a simple and effective algorithm that
> determinate if that two sticks are conected by a 'intersected-sticks' path.
do you mean a test to see if two line segments intersect?
This looks reasonable:
It probably makes sense to translate to Cython (or use the C and call with
I"ve also got similar code in a little package of mine:
Already Cython, and includes code to check a whole bunch at once, stored in
I hope it's useful to you.
> Any idea for that?
> Thanks a lot!
> NumPy-Discussion mailing list
> NumPy-Discussion at scipy.org
Christopher Barker, Ph.D.
Emergency Response Division
NOAA/NOS/OR&R (206) 526-6959 voice
7600 Sand Point Way NE (206) 526-6329 fax
Seattle, WA 98115 (206) 526-6317 main reception
Chris.Barker at noaa.gov
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the NumPy-Discussion