Thanks guys. So far the fuzzy/epsilon/delta method is working. @ivan, yeah the problem is with using == operators with floats. I spent over a week doing my incredibly comprehensive line intersection algo, so i'd stick with it a bit longer. Here is it in all its glory. Read and be awed. Or laugh at m...

i am currently checking intersection of thousands of lines which in turn require slope comparisons. Out of the thousands of slopes, few always come up wrong no matter what i do. Your delta method looks very simple and nice. Gotta try ! Got any more tricks for floats? I am not a good programmer and l...

Heyo So, I spent the last week debugging my binary partitioning algorithm using print and console commands. I combed through my code hundreds of times but couldn't identify the issues. Till today. the issue was with floats. See, my code is full of variable comparisions there were comparisons like A ...

Working on something more basic. Voronoi plots without using Fortune's algorithm.
If it works properly, i'd like to package it as a library and share with all.

oh dear. that sucks. :( I am working of a neighbour algorithm right now. was hoping there was some way of avoiding it. Its getting messy with every line i write. :( @vrld. thanks. i learn new things everytime on this forum. it will help me optimize my intersection a lot. I can simply remove all non ...

Hi I have a grid composed of convex polygons with variable sides. SOmething similar to voronoi plots. For any face/polygon i want to find all its neighbouring polygons (which share a side). For regular grids made of rectangles, triangles, heaxgons wtc, we can simply employ an indexing system which g...

Thanks everyone.
My current implementation does works but I was wondering if using the Shape object will be much faster.

Hi i have a polygon made up of x1, y1, x2, y2, ... xn, yn vertices. there is a line y = mx + a which goes through the polygon. How can i find the points where the line touches the polygon? I was planning on using the physics module and the Shape:testSegment function. But it looks like its been depre...

thanks everyone. lots of good ideas here. Gonna try them now.

Hi I am creating a procedural graph made up of points and lines connecting the said points. I have created a list of edges/lines as; { {{a1, b1}, {x1, y1} }, {{a2, b2}, {x2, y2} }, ... ... {{an, bn}, {xn, yn} } } Now I want to find all the unique edges. Ie. remove all edges that have same starting p...