Hi guys, I am struggling to point the intersection of two graphs. I am currently working on time complexity on sorting algorithms in insertion and merge. My data sets for the graphs will follow like: plot(elements,times , label = "insertion sort" , background_color=RGB(40/255, 0/255, 60/255)) plo…

Assuming the data for elements and elements2 are different, I would make a low-order polynomial model of each curve, based on data spanning the intersection and using the Polynomials package, subtract the two polynomials, and then find the root of the difference polynomial using NLsolve or Polynomia…

But since the data is from simulation, you should be able to do timings at the same elements values. Then you could subtract the discrete data, looking for a sign change in the difference, model the difference with a polynomial over a few data points with the sign change near the center, and then so…

[image] John_Gibson: NLsolve The answer is too theoretical for a newbie like me :slight_smile: I am looking for an example code for any similar given issue. Thank you for your contribution.

Ok, I’ll give you some example code later tonight, after kids are in bed!

Here is some possible code to achieve this goal: using Interpolations, Optim # install packages if needed y1 = interpolate((elements,), times, Gridded(Linear())) y2 = interpolate((elements2,), times2, Gridded(Linear())) domain = intersect( range(extrema(elements)...), range(extrema(elements…

[image] wrisurcuriosity: I am looking for an example code for any similar given issue. Fyi, this problem was posted before in Discourse, with a simple solution using splines.

Some example code for computing the intersection of curves from discrete data points using polynomial fits. This code blocks creates some artificial data. using Polynomials, Plots # two functions that intersect on an interval (a,b) f1(x) = 2x + 12 f2(x) = x^2 (a,b) = (2,7) # the interval of in…

Or, with GMT (intersection point is computed from linear interpolation, I think) using GMT f1(x) = 2x + 12; f2(x) = x^2; x = range(2, 7, length=10); y1 = f1.(x); y2 = f2.(x); int = gmtspatial(([x y1],[x y2]), intersections=:e); plot([x y1], limits=(2,7,0,50), marker=:circ, mc=:blue, ms="6p", l…

Nice! Though in all honestly I feel the acronym package name GMT hinders discoverability. The name GeneralizedMappingTools.jl would be better for the general public. EDIT: I see now that GMT.jl is a wrapper for the GMT C library, so the acronym name follows the Julia naming standards.

Yes, and we also have a GMT/MEX, for Matlab pyGMT, for Python GMT.jl for Julia Not to mention that GMT is a brand with > 30 years, very well known in Geophysics.

Mark the Intersection Points on a Plot Graph

New to Julia

rafael.guerra November 26, 2022, 6:10am 7

Fyi, this problem was posted before in Discourse, with a simple solution using splines.

Topic		Replies	Views
Intersection of two plots General Usage question , plotting	4	895	May 12, 2023
Find intersection between curves in julia New to Julia roots , interpolations , splines	13	3614	October 28, 2021
Signing the points were 2 functions are equal New to Julia plotting	2	329	March 18, 2021
How to find the intercept of two functions? New to Julia	6	1263	June 8, 2020
Plots How to get exact point of intersection of a plot with axis? General Usage plotting , gr , gaston	4	1135	March 21, 2020

Mark the Intersection Points on a Plot Graph

Related topics