Prety Pologons, Think it's worth an article?
-
What kind of file is SVG? IE wants to download that link as a file, but I don't know what to do with it.
-
What kind of file is SVG? IE wants to download that link as a file, but I don't know what to do with it.
from a previous century: Scalable_Vector_Graphics[^] :laugh:
Luc Pattyn [Forum Guidelines] [Why QA sucks] [My Articles]
I only read code that is properly formatted, adding PRE tags is the easiest way to obtain that.
All Toronto weekends should be extremely wet until we get it automated in regular forums, not just QA.
-
Intersection of polygons, finding a polynomial time solution[^] The goal of this research is to find the fastest polygon intersection algorithm, right now it is just a prototype demo, I am exploring graph theory to try to solve the problem. Just refresh to redraw the image..
"Make everything as simple as possible, but not simpler." -- Albert Einstein "It didn't matter to us whether people believed in us. We believed in ourselves. We had the courage to follow our own path." ~~Nvidia's Jen-Hsun Huang
I would love to see an article about this.
-
I would love to see an article about this.
Okay great I will feature on in WPF on Covext Hull Intersections and one on the use of the Big O algroythm Analizer which I will use to demonstrate how to sacle an algroythm for best performance! :cool:
"Make everything as simple as possible, but not simpler." -- Albert Einstein "It didn't matter to us whether people believed in us. We believed in ourselves. We had the courage to follow our own path." ~~Nvidia's Jen-Hsun Huang
-
Intersection of polygons, finding a polynomial time solution[^] The goal of this research is to find the fastest polygon intersection algorithm, right now it is just a prototype demo, I am exploring graph theory to try to solve the problem. Just refresh to redraw the image..
"Make everything as simple as possible, but not simpler." -- Albert Einstein "It didn't matter to us whether people believed in us. We believed in ourselves. We had the courage to follow our own path." ~~Nvidia's Jen-Hsun Huang
What kind of polygons are you planning to consider? If I am not mistaken convex-convex polygon intersection is linear, so not very interesting (ref[^]). For convace, self intersecting, or with holes it will be interesting to see the inner working of the algorithm. Have you came across GPC[^]. -Saurabh
-
What kind of polygons are you planning to consider? If I am not mistaken convex-convex polygon intersection is linear, so not very interesting (ref[^]). For convace, self intersecting, or with holes it will be interesting to see the inner working of the algorithm. Have you came across GPC[^]. -Saurabh
Saurabh.Garg wrote:
What kind of polygons are you planning to consider? If I am not mistaken convex-convex polygon intersection is linear, so not very interesting (ref[^]). For convace, self intersecting, or with holes it will be interesting to see the inner working of the algorithm. Have you came across **GPC[^]**Is Infected with a virus!.
Right now it is a graph theory looking to achieve O(n log n). The link you sent is infected with a virus and I can not download the PDF from the GPC link. This really sux because I read the article on a friends computer on Saturday and she didn't have the best virus protection, now she is infected! From what I read it is not using graph theory, so I will get different results, and then I'm going to try an FFT to to make it even faster. But it was interesting. The problem has been solved it seems, but the algorithm does not offer guaranteed time complexity, has to do with the way the algorithm does the shifting. I think the graph algorithm would be faster because it's not doing any scanning of the whole image, just the polygon points and intersections. And yes this is for convex polygons only at this point, if I have enough time I will expand it to concave polygons.
"Make everything as simple as possible, but not simpler." -- Albert Einstein "It didn't matter to us whether people believed in us. We believed in ourselves. We had the courage to follow our own path." ~~Nvidia's Jen-Hsun Huang
-
Saurabh.Garg wrote:
What kind of polygons are you planning to consider? If I am not mistaken convex-convex polygon intersection is linear, so not very interesting (ref[^]). For convace, self intersecting, or with holes it will be interesting to see the inner working of the algorithm. Have you came across **GPC[^]**Is Infected with a virus!.
Right now it is a graph theory looking to achieve O(n log n). The link you sent is infected with a virus and I can not download the PDF from the GPC link. This really sux because I read the article on a friends computer on Saturday and she didn't have the best virus protection, now she is infected! From what I read it is not using graph theory, so I will get different results, and then I'm going to try an FFT to to make it even faster. But it was interesting. The problem has been solved it seems, but the algorithm does not offer guaranteed time complexity, has to do with the way the algorithm does the shifting. I think the graph algorithm would be faster because it's not doing any scanning of the whole image, just the polygon points and intersections. And yes this is for convex polygons only at this point, if I have enough time I will expand it to concave polygons.
"Make everything as simple as possible, but not simpler." -- Albert Einstein "It didn't matter to us whether people believed in us. We believed in ourselves. We had the courage to follow our own path." ~~Nvidia's Jen-Hsun Huang
I don't think there is virus in the link, I just tested it again. The site is hosted at University of Manchester's website and I can browse it without any problems. I use GPC for my research purposes. I am little confused about the input to the problem. When you say polygon I think of ordered set of point in 2D but it seems that you are thinking about images. For polygons lot of research has been done and especially for convex polyon we already have linear time algorithms. -Saurabh
-
I don't think there is virus in the link, I just tested it again. The site is hosted at University of Manchester's website and I can browse it without any problems. I use GPC for my research purposes. I am little confused about the input to the problem. When you say polygon I think of ordered set of point in 2D but it seems that you are thinking about images. For polygons lot of research has been done and especially for convex polyon we already have linear time algorithms. -Saurabh
No I'm using a prety hard core antivirus program, total internet security, it poped up with a virus right wehn the page loaded. Won't even let me browse the page any more.
"Make everything as simple as possible, but not simpler." -- Albert Einstein "It didn't matter to us whether people believed in us. We believed in ourselves. We had the courage to follow our own path." ~~Nvidia's Jen-Hsun Huang
-
No I'm using a prety hard core antivirus program, total internet security, it poped up with a virus right wehn the page loaded. Won't even let me browse the page any more.
"Make everything as simple as possible, but not simpler." -- Albert Einstein "It didn't matter to us whether people believed in us. We believed in ourselves. We had the courage to follow our own path." ~~Nvidia's Jen-Hsun Huang
Ever heard of false negatives? -Saurabh
-
Ever heard of false negatives? -Saurabh
Not for a heurstic algroythm for analyzing viruses, not unless some idiot put the signature in the html, and why would they do that? Beleive me if my scanner goes off and tells me it's a virus, it is a virus. Viruses are the easiest programs to write, but finding it's signature is no problem. Its like a needle in a haysack that is full of everything but needles, and the heuristics they use to find viruses are about 99.9% correct. If you don't believe me look for your self: Virus found JS/Psyme;"www.cs.man.ac.uk/~toby/alan/software/";"Object was blocked"
"Make everything as simple as possible, but not simpler." -- Albert Einstein "It didn't matter to us whether people believed in us. We believed in ourselves. We had the courage to follow our own path." ~~[Nvidia's Jen-Hsun Huang
modified on Tuesday, February 23, 2010 5:00 AM
