|
-
February 2nd, 2011, 02:25 PM
#1
Line segment intersection
I need a C++ implementation of an efficient algorithm to detect line segment intersection. I'm reasonably familiar with Bentley-Ottmann, but it has limitations on what sorts of inputs it can handle that I'm pretty sure will be violated in my case. I've also read about this one:
http://www.akira.ruc.dk/~keld/teachi...Chazelle92.pdf
but unfortunately I don't have time to read through all that and it doesn't seem to include anything as useful as pseudocode or a step-by-step summary.
I'm wondering if anyone knows a robust, public domain implementation out there which I can leverage until I have time to write my own version.
Posting Permissions
- You may not post new threads
- You may not post replies
- You may not post attachments
- You may not edit your posts
-
Forum Rules
|
Click Here to Expand Forum to Full Width
|