UPDATE: Smoothing of the contour or changing bin sizes is not what I'm looking for as solutions. The contours shown in the provided graph are ideal for the purpose of this code, i'm looking to find points between the existing contours vertices.
Use of the function [conxy] = contour(… returns the vertices of the contour line(s). I wish to obtain points along the contour between vertices so another function can distribute waypoints around the contour at equisdistant (or closely distant due to inevitable differences in lengths between points not discretising equally) points along the contour perimeter. The main issue is when certain sections of the contour have a large number of vertices, the waypoints can end up very close to one another after using linspace.
The graph provided shows the returned contour vertices as cyan markers. The larger purple markers are the current waypoints returned by, Waymark = conx(round(linspace(1,length(conx), no_wpt))). The other lines are just to find which two points have the greatest offset on a contour (unrelated to question). The parula (colormap) scattered data are x, y offsets with z defined as the heading (it's a ship). The contours are based off of a hist3 grid. I do not wish to use any contour smoothing function, only increase number of points along the existing contour.
Best Answer