# Tag Info

Accepted

### Find the equidistance curve between two curves

f[x_] := x^x g[x_] := Log[x]^Log[x] h[x_] := Log[x]^2 plot = Plot[{f[x], g[x], h[x]}, {x, 0, E}, PlotRange -> {0, 1}] Extract the three lines from ...
• 399k

### Find the equidistance curve between two curves

Here we manual create the normal line of the three differentiable curves. ...
• 77.8k
Accepted

### Draw a circle through 4 points on parabola

This is a motivating post. I have made no effort to deal with intersection <4 pts. I post only illustrative examples. The centre of the circle is the intersection of perpendicular bisectors of ...
• 62.8k

### How can I solve for the intersection points of two ellipses?

Solve can be used directly ...
• 160k

### Bug or undocumented behaviour in Intersection

Maybe this produces does what you want (it is basically what Manuel --Moe-- G suggested). ...

### Rounding an Irregular Polygon

A quick hack, essentially interpolating a point travelling at constant speed on polygon edge and averaging the position over a time interval: ...
• 19.1k
Accepted

### How can I find least squares intersection of 3D rays?

EDIT: As @nikie noted, using FindArgMin (a variant of FindMinimum) instead of (N)ArgMin can ...
• 19.1k

...
• 8,834
Accepted

### How to compute intersections of circles on a lattice

Update: Disjoint regions corresponding to the intersection of exactly k disks for k = 1, 2, 3, 4. Computation of 7-by-7 ...
• 399k

### How can I solve for the intersection points of two ellipses?

You can (1) use Cases to extract the Lines from ContourPlot output, and (2) use ...
• 399k

### How can I find least squares intersection of 3D rays?

Here's another way to implement kirma's solution: ...
Accepted

### Rounding an Irregular Polygon

Not an anwser, yet. This is how the curve shorthening flow would act on the cells: As you can see, the cells lose contact. So this is probably not what you are looking for, right? Something similar ...
Accepted

### GraphicsMeshFindIntersections not working in Mathematica 13.3

\$Version "13.3.1 for Microsoft Windows (64-bit) (July 24, 2023)" ...
• 77.8k

### How to compute intersections of circles on a lattice

Update Here is a revised version of my answer that is much faster. First, I define the function RegionPieces which takes a region and its neighbors, and creates ...
• 131k
Accepted

### Identifying lattice squares that are intersected by a closed curve

rectangles = Rectangle /@ Tuples[Range[-8, 7, 1], {2}] Count[_?(Not @ RegionDisjoint[Circle[{0, 0}, Sqrt[59]], #] &)] @ rectangles ...
• 399k

### How to compute the boundary of a group of ellipse efficiently?

Solution for Update1 The ellipses described by matThetaList can be plotted by ...
• 61.8k
Accepted

### Remove zig-zag part in the intersection curve

1 You can use the option BoundaryStyle instead of MeshFunctions and Mesh in ...
• 399k

...
• 160k
Accepted

...
• 399k
Accepted

### Get the intersection points of the boundary of the region along with an oriented curve in order

SignedRegionDistance do the job. But my code only work for the updated example, not for the first example since there are extra values of the parametric ...
• 77.8k
Accepted

...
• 399k

### Is there a method to simplify RegionIntersection between 2 spheres?

Do not use Graphics3D with regions. You cannot get Circle as simplified version, as it is 2D primitive in Wolfram Language (read ...
• 73.4k

...
• 41.8k
Accepted

### Fitting a curve between two sets of points

You can use FindMinimum to fit a smooth spline between these point sets. First of all, let's extract the red and black points in your image: ...
• 36.2k

### Rounding an Irregular Polygon

Here is an approach that is very similar to Henrik's second one. The idea is to use bezier curves, which have (as you might know from Illustrator or Inkscape) fixed points and "handles" that adjust ...
• 113k

### Finding all intersection point between two time series

There's a long winded way with TimeSeriesThread or interpolation and subtracting the curves to find zero crossings, however there's also a shortcut where you can ...
• 25.6k
Accepted

### Parametrization of intersections

Try to solve the two equations for x,z to get a parametrization for the intersection curves {x[y],y,z[y]}: ...
• 54.9k
Accepted

### Finding intersection of two curves using mesh functions

This maybe works like before: ...
• 3,570