Comments on: Code: 2D line intersection http://workshop.evolutionzone.com/2007/09/10/code-2d-line-intersection/ Computational aesthetics and programming for artists and designers. Tue, 31 Jan 2012 05:39:21 -0500 hourly 1 http://wordpress.org/?v=3.1 By: Jorge http://workshop.evolutionzone.com/2007/09/10/code-2d-line-intersection/comment-page-1/#comment-392525 Jorge Tue, 29 Nov 2011 18:28:59 +0000 http://workshop.evolutionzone.com/2007/09/10/code-2d-line-intersection/#comment-392525 Hi! Both seams to work well, but what would I need to change to not detect an intersection if the line only touches the other? Thank you Hi!

Both seams to work well, but what would I need to change to not detect an intersection if the line only touches the other?

Thank you

]]> By: Moj http://workshop.evolutionzone.com/2007/09/10/code-2d-line-intersection/comment-page-1/#comment-358037 Moj Sat, 24 Sep 2011 18:13:08 +0000 http://workshop.evolutionzone.com/2007/09/10/code-2d-line-intersection/#comment-358037 If first set of code, there is "ub=(xD1*yD3-yD1*xD3)/div;". Is "ub" used anywhere?? If first set of code, there is “ub=(xD1*yD3-yD1*xD3)/div;”. Is “ub” used anywhere??

]]> By: darus http://workshop.evolutionzone.com/2007/09/10/code-2d-line-intersection/comment-page-1/#comment-347446 darus Sat, 27 Aug 2011 13:06:43 +0000 http://workshop.evolutionzone.com/2007/09/10/code-2d-line-intersection/#comment-347446 The first Code is more precise, althoug slower, but I used it for collision detection. The second code messes up when using it for moving an object (the calculated intersection is not 100% correct) The first Code is more precise, althoug slower, but I used it for collision detection.

The second code messes up when using it for moving an object (the calculated intersection
is not 100% correct)

]]> By: Shashank http://workshop.evolutionzone.com/2007/09/10/code-2d-line-intersection/comment-page-1/#comment-278820 Shashank Fri, 14 Jan 2011 18:35:12 +0000 http://workshop.evolutionzone.com/2007/09/10/code-2d-line-intersection/#comment-278820 Very nice and informative post.......and comments are also amazing....thanx for the code. Very nice and informative post…….and comments are also amazing….thanx for the code.

]]> By: marius watz http://workshop.evolutionzone.com/2007/09/10/code-2d-line-intersection/comment-page-1/#comment-244693 marius watz Sun, 04 Jul 2010 01:42:49 +0000 http://workshop.evolutionzone.com/2007/09/10/code-2d-line-intersection/#comment-244693 Hi Oito! It looks like the ub calculation is redundant, an oversight on my part. Hi Oito! It looks like the ub calculation is redundant, an oversight on my part.

]]> By: oito http://workshop.evolutionzone.com/2007/09/10/code-2d-line-intersection/comment-page-1/#comment-243979 oito Thu, 01 Jul 2010 08:07:07 +0000 http://workshop.evolutionzone.com/2007/09/10/code-2d-line-intersection/#comment-243979 Hi, thanks for the code. What are you calculating ub for? Hi,

thanks for the code. What are you calculating ub for?

]]> By: miska http://workshop.evolutionzone.com/2007/09/10/code-2d-line-intersection/comment-page-1/#comment-232650 miska Thu, 29 Apr 2010 07:27:37 +0000 http://workshop.evolutionzone.com/2007/09/10/code-2d-line-intersection/#comment-232650 aha! just what I've always wanted but didn't know where to find :) many thanks! aha! just what I’ve always wanted but didn’t know where to find :)

many thanks!

]]> By: Henri de Feraudy http://workshop.evolutionzone.com/2007/09/10/code-2d-line-intersection/comment-page-1/#comment-230989 Henri de Feraudy Tue, 20 Apr 2010 08:33:24 +0000 http://workshop.evolutionzone.com/2007/09/10/code-2d-line-intersection/#comment-230989 It looks like you are just comparing every segment to every other segment for intersection. This is what I did at start, but becomes horribly slow in large data sets. It's much faster to use the line-sweep algorithm as described in Computational Geometry: Algorithms and Applications by Marc de Berg et al It looks like you are just comparing every segment to every other segment for intersection. This is what I did at start, but becomes horribly slow in large data sets. It’s much faster to use the line-sweep algorithm as described in Computational Geometry: Algorithms and Applications by
Marc de Berg et al

]]> By: ibly http://workshop.evolutionzone.com/2007/09/10/code-2d-line-intersection/comment-page-1/#comment-180501 ibly Thu, 13 Aug 2009 04:30:18 +0000 http://workshop.evolutionzone.com/2007/09/10/code-2d-line-intersection/#comment-180501 Thanks alot! I'm using this in an iPhone game that I'm working on. All I had to do is port it to Objective C. Thanks alot! I’m using this in an iPhone game that I’m working on. All I had to do is port it to Objective C.

]]> By: SherlockForms Project BLOG » 如何判定二个点，线或面是否相交 http://workshop.evolutionzone.com/2007/09/10/code-2d-line-intersection/comment-page-1/#comment-58537 SherlockForms Project BLOG » 如何判定二个点，线或面是否相交 Fri, 28 Mar 2008 03:41:13 +0000 http://workshop.evolutionzone.com/2007/09/10/code-2d-line-intersection/#comment-58537 [...] http://workshop.evolutionzone.com/2007/09/10/code-2d-line-intersection/ [...] [...] http://workshop.evolutionzone.com/2007/09/10/code-2d-line-intersection/ [...]

]]>