Skip to main content
10 events
when toggle format what by license comment
Dec 23, 2009 at 19:08 history closed Greg Kuperberg
user350
Anton Geraschenko
off topic
Dec 23, 2009 at 19:08 comment added Anton Geraschenko I'm closing the question because it may be off topic and it is sufficiently vaguely formulated that you'd have to guess what the real question is before answering it. If you edit the question to be more precise, please flag it for moderator attention and we'll consider reopening it.
Dec 23, 2009 at 18:18 comment added David E Speyer @Reid There are formulations of the problem that get around that. For example, you can look for an algorithm whose running time is linear in the size of the output.
Dec 23, 2009 at 17:32 comment added Reid Barton In general, you cannot do better, because there may be mn intersections.
Dec 23, 2009 at 16:45 comment added Greg Kuperberg My vote is to ask at StackOverflow.
Dec 23, 2009 at 16:43 answer added TerronaBell timeline score: 5
Dec 23, 2009 at 14:38 comment added David E Speyer I think the subject matter is OK and, piecing together all the clues, I think I know what the question must be. That said, I shouldn't have to piece together clues. ET, can you confirm that the following is correct: we have m triangles and n rays in three dimensional space. I am not sure whether or not the rays all pass through the origin. We wish to find every pair (ray, triangle), so that the ray and triangle meet. There is an obvious O(mn) algorithm -- check each pair. Can we do better?
Dec 23, 2009 at 11:38 comment added Pete L. Clark I don't know -- algorithmic geometry seems to have one foot in mathematics. I have a different issue with the question: I feel that it is very vaguely worded.
Dec 23, 2009 at 10:39 comment added Ilya Nikokoshev StackOverflow would be a right place for computer science questions.
Dec 23, 2009 at 10:00 history asked ET 0.618 CC BY-SA 2.5