I found a great solution by Paul Bourke. Here it is, implemented in JavaScript: function line_intersect(x1, y1, x2, y2, x3, y3, x4, y4) { var ua, ub, denom = (y4 – y3)*(x2 – x1) – (x4 – x3)*(y2 – y1); if (denom == 0) { return null; } ua = ((x4 – x3)*(y1 – y3) … Read more
First of all this is wrong: public bool Equals(MyClass item1, MyClass item2) { return GetHashCode(item1) == GetHashCode(item2); } If the hashcode’s are different for sure the corresponding 2 items are different, but if they’re equal is not guaranteed that the corresponding 2 items are equal. So this is the correct Equals implementation: public bool Equals(MyClass … Read more
You can use np.sign in combination with np.diff and np.argwhere to obtain the indices of points where the lines cross (in this case, the points are [ 0, 149, 331, 448, 664, 743]): import numpy as np import matplotlib.pyplot as plt x = np.arange(0, 1000) f = np.arange(0, 1000) g = np.sin(np.arange(0, 10, 0.01) * … Read more
In TypeScript, any is an escape hatch from the type system. Or maybe a black hole that eats up every other type it touches. It is treated both as a top type (any value can be assigned to a variable of type any) and a bottom type (a value of type any can be assigned … Read more
First I will remind us how to find the area of a polygon. Once we have done this, the algorithm to find the intersection between a polygon and a circle should be easy to understand. How to find the area of a polygon Let’s look at the case of a triangle, because all the essential … Read more
You can merge them so: s1 = pd.merge(dfA, dfB, how=’inner’, on=[‘S’, ‘T’]) To drop NA rows: s1.dropna(inplace=True)
Intersection of Bezier curves is done by the (very cool) Asymptote vector graphics language: look for intersect() here. Although they don’t explain the algorithm they actually use there, except to say that it’s from p. 137 of “The Metafont Book”, it appears that the key to it is two important properties of Bezier curves (which … Read more
Here you are. The interesting methods are getIntersections and getIntersection. The former parses over all polygon segments and checks for intersections, the latter does the actual calculation. Do keep in mind that the calculation can be seriously optimized and doesn’t check for division by 0. This will also work only for polygons. It could be … Read more
Given the following: interface A { a: number; c: number; } interface B{ b: boolean; c: number; } Expression of Union type A | B is assignable to either A or B. It must have properties from A or B (or both) const oA: A | B = { a: 6, c: 6 } const … Read more