18 votes
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 ...
kglr's user avatar
  • 395k
18 votes

Find the equidistance curve between two curves

Here we manual create the normal line of the three differentiable curves. ...
cvgmt's user avatar
  • 72.9k
17 votes
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 ...
ubpdqn's user avatar
  • 60.8k
15 votes

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

Solve can be used directly ...
Bob Hanlon's user avatar
  • 158k
14 votes

Bug or undocumented behaviour in Intersection

Maybe this produces does what you want (it is basically what Manuel --Moe-- G suggested). ...
Henrik Schumacher's user avatar
14 votes

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: ...
kirma's user avatar
  • 19.1k
13 votes
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 ...
kirma's user avatar
  • 19.1k
13 votes

Select spheres intersecting with big sphere from list

...
Thies Heidecke's user avatar
13 votes
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 ...
kglr's user avatar
  • 395k
13 votes

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 ...
kglr's user avatar
  • 395k
11 votes

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

Here's another way to implement kirma's solution: ...
J. M.'s missing motivation's user avatar
11 votes
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 ...
Henrik Schumacher's user avatar
11 votes
Accepted

Graphics`Mesh`FindIntersections not working in Mathematica 13.3

$Version "13.3.1 for Microsoft Windows (64-bit) (July 24, 2023)" ...
cvgmt's user avatar
  • 72.9k
10 votes

Equation for the line of intersection between two planes

Just to illustrate some other things. You can which parametrization you like. In this case parametrization in terms of x: ...
ubpdqn's user avatar
  • 60.8k
10 votes

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 ...
Carl Woll's user avatar
  • 131k
10 votes
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 ...
kglr's user avatar
  • 395k
9 votes

Equation for the line of intersection between two planes

You could use sol = Solve[{2 x + y + z == 1, 3 x - 2 y - z == 5}, {x, y}] // Simplify giving ...
John McGee's user avatar
  • 2,538
9 votes

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

Solution for Update1 The ellipses described by matThetaList can be plotted by ...
bbgodfrey's user avatar
  • 61.5k
9 votes
Accepted

Remove zig-zag part in the intersection curve

1 You can use the option BoundaryStyle instead of MeshFunctions and Mesh in ...
kglr's user avatar
  • 395k
9 votes

How to get a manipulated plot of the intersection points of two curves without finding them numerically?

...
Bob Hanlon's user avatar
  • 158k
9 votes
Accepted

How to get a manipulated plot of the intersection points of two curves without finding them numerically?

...
kglr's user avatar
  • 395k
8 votes
Accepted

Plot and find intersection points of multiple curves

...
kglr's user avatar
  • 395k
8 votes

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 ...
Vitaliy Kaurov's user avatar
7 votes

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

Here is an approach that seems to work for the cases presented, I think it may be general if you're only dealing with two curves. For more than two curves, you'll just need to extend the approach a ...
RunnyKine's user avatar
  • 33.1k
7 votes

How to compute intersections of circles on a lattice

...
David G. Stork's user avatar
7 votes
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: ...
Niki Estner's user avatar
  • 36.1k
7 votes

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 ...
halirutan's user avatar
  • 113k
7 votes

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 ...
flinty's user avatar
  • 25.3k
7 votes
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]}: ...
Ulrich Neumann's user avatar
6 votes

Partition a line around intersections

You're correct in that MMA provides a simpler way to find the intersections: ...
Quantum_Oli's user avatar
  • 7,964

Only top scored, non community-wiki answers of a minimum length are eligible