Here is a Python example which finds the intersection of a line and a plane. Where the plane can be either a point and a normal, or a 4d vector (normal form), In the examples below (code for both is provided). Also note that this function calculates a value representing where the point is on … Read more
I wrote an aiming subroutine for xtank a while back. I’ll try to lay out how I did it. Disclaimer: I may have made one or more silly mistakes anywhere in here; I’m just trying to reconstruct the reasoning with my rusty math skills. However, I’ll cut to the chase first, since this is a … Read more
Intersection of two circles Written by Paul Bourke The following note describes how to find the intersection point(s) between two circles on a plane, the following notation is used. The aim is to find the two points P3 = (x3, y3) if they exist. First calculate the distance d between the center of the circles. … Read more
I would recommend simply doing a line-segment-line-segment intersection check on each line segment (edge) that makes up the rectangle. Here is a line segment intersection detection algorithm I wrote ages ago, dredged up from one of my old XNA projects: // a1 is line1 start, a2 is line1 end, b1 is line2 start, b2 is … Read more
These are the connected components of a graph, and can be found using a graphing library such as networkx. For your second example: >>> edges = [(1, 5), (4, 2), (4, 3), (5, 4), (6, 3), (7, 6), (8, 9)] >>> graph = nx.Graph(edges) >>> [tuple(c) for c in nx.connected_components(graph)] [(1, 2, 3, 4, 5, … Read more
You need to first transform data1, in your case by calling ToString() on each element. Use this if you want to return strings. List<int> data1 = new List<int> {1,2,3,4,5}; List<string> data2 = new List<string>{“6″,”3”}; var newData = data1.Select(i => i.ToString()).Intersect(data2); Use this if you want to return integers. List<int> data1 = new List<int> {1,2,3,4,5}; List<string> … Read more
You can use retainAll method: columnsOld.retainAll (columnsNew);
If you literally just have two random vectors of numbers, you can use a pretty simple technique to get the intersection of both. Just find all points where x1 is above x2, and then below it on the next point, or vice-versa. These are the intersection points. Then just use the respective slopes to find … Read more
For each edge in both polygons, check if it can be used as a separating line. If so, you are done: No intersection. If no separation line was found, you have an intersection. /// Checks if the two polygons are intersecting. bool IsPolygonsIntersecting(Polygon a, Polygon b) { foreach (var polygon in new[] { a, b … Read more
A little known fact is that you don’t need to construct sets to do this: In Python 2: In [78]: d1 = {‘a’: 1, ‘b’: 2} In [79]: d2 = {‘b’: 2, ‘c’: 3} In [80]: d1.viewkeys() & d2.viewkeys() Out[80]: {‘b’} In Python 3 replace viewkeys with keys; the same applies to viewvalues and viewitems. … Read more