Skip to main content

plotting - Custom interpolation algorithm


Suppose I have a list to create a list density plot, the list format is:


list = {{0.5, 0.5, 0.0}, {-0.5, 0.5, 1.0}, {1.0, -0.45, 0.0}, {0.0, 0.0, 0.0}}

The size of the list is about 10^5 elements


The plot will show a point or nothing at all. The real data produces this picture:


enter image description here


My goal is to make solid lines so that the shapes look smooth, however, I also need a list containing all the points that make the smoothed out picture. Since I know the distance of the mesh, I was thinking about a procedure that would go through the whole grid searching for neighboring points and if there exists a point with {x, y, 1} would fill in the blanks. I'm stuck in the criterion to use for this though. Any thoughts?




Answer



I imported your posted data:


raw = Import["array1.CSV"];

Then selected one of the features, and reduced it to two-dimensional, since the third dimension is uniformly equal to $1$ for the points constituting the feature:


single = Cases[raw, {a_, b_, 1.} :> {a, b} /; (-0.2 < a < 0.2 && 0.2 < b)];

ListPlot[
single,
PlotRange -> {0.2, 0.5}, AspectRatio -> Automatic

]

plot


I isolate the oval feature manually:


oval = Cases[single, {a_, b_} /; (-0.07 < a < 0.07 && 0.35 < b < 0.472)];

ListPlot[
oval,
PlotRange -> {0.39, 0.48}, AspectRatio -> Automatic
]


oval points


Then I fit an axis-aligned ellipse to it, by generating an appropriate squared distance function to be minimized, then making the assumption that the abscissa of the center is $0$, which seems reasonable given the symmetry of the system, and imposing reasonable constraints on the other parameters obtained from inspection of the graph:


obj[a_, b_, xc_, yc_] = Total[
Simplify[
SquaredEuclideanDistance[{#1, #2}, (#1 - xc)^2/a^2 + (#2 - yc)^2/b^2 - 1] & @@@ oval,
_ ∈ Reals
]
];


minPars = FindMinimum[{obj[a, b, 0, yc], 0.42 < yc < 0.46}, {{a, 0.5}, {b, 0.5}, {yc, 0.44}}]

(* {14.2803, {a -> 0.0518811, b -> 0.0312114, yc -> 0.439966}} *)

It's a pretty good fit, despite the few stray points we had to tolerate:


cplot = ContourPlot[
Evaluate[((x - 0)^2/a^2 + (y - yc)^2/b^2 == 1) /. First@Rest@minPars],
{x, -0.08, 0.08}, {y, 0.4, 0.48},
Epilog -> Point[oval], AspectRatio -> Automatic
]


fit oval and points


Now, we can extract the line shape from the contour plot results:


ovalLine = First@Cases[Normal@cplot, _Line, Infinity];



I then carefully select the points at the periphery of your feature, through somewhat laborious manual filtering:


rdf = RegionDistance[ovalLine];

externalPoints = Join[

DeleteCases[single, pt_ /; rdf[pt] < 0.00715],
Complement[
Select[single, #[[2]] > 0.4713 &],
MinimalBy[Select[single, #[[2]] > 0.4713 &], Abs@#[[1]] &, 2]
]
];

Graphics@Point@externalPoints

external



I then use the fantastic alphaShapes2DC function proposed by RunnyKine in this answer, to generate a "concave hull" of those points:


alphaShapes2DC[externalPoints, .10]

alpha shape


In fact, I will turn the 2D region returned by that function into a boundary mesh region, with some formatting for appearances only:


reg = BoundaryDiscretizeRegion[
alphaShapes2DC[externalPoints, .10],
MeshCellStyle -> {{1, All} -> Directive[Thick, Red]},
PlotTheme -> "Lines"
];


formatted alpha shape




Let's now put it all together:


Show[reg, Graphics[{Thick, Red, ovalLine}]]

both lines


And here's a comparison to the original points:


Show[reg, Graphics[{Thick, Red, ovalLine, Black, Point[single]}]]


with points




And finally let's generate polygons and rotate them around the axis to generate the final shape:


allShapes = NestList[
GeometricTransformation[#, RotationTransform[2 Pi/3, {0, 0}]] &,
MeshPrimitives[reg, 2],
2
];

allOvals = NestList[

GeometricTransformation[#, RotationTransform[2 Pi/3, {0, 0}]] &,
Polygon @@ ovalLine,
2
];

Graphics[{FaceForm[None], EdgeForm[{Thick, Red}], allOvals, allShapes}]

final


Comments

Popular posts from this blog

plotting - How to draw lines between specified dots on ListPlot?

I would like to create a plot where I have unconnected dots and some connected. So far, I have figured out how to draw the dots. My code is the following: ListPlot[{{1, 1}, {2, 2}, {3, 3}, {4, 4}, {1, 4}, {2, 5}, {3, 6}, {4, 7}, {1, 7}, {2, 8}, {3, 9}, {4, 10}, {1, 10}, {2, 11}, {3, 12}, {4,13}, {2.5, 7}}, Ticks -> {{1, 2, 3, 4}, None}, AxesStyle -> Thin, TicksStyle -> Directive[Black, Bold, 12], Mesh -> Full] I have thought using ListLinePlot command, but I don't know how to specify to the command to draw only selected lines between the dots. Do have any suggestions/hints on how to do that? Thank you. Answer One possibility would be to use Epilog with Line : ListPlot[ {{1, 1}, {2, 2}, {3, 3}, {4, 4}, {1, 4}, {2, 5}, {3, 6}, {4, 7}, {1, 7}, {2, 8}, {3, 9}, {4, 10}, {1, 10}, {2, 11}, {3, 12}, {4, 13}, {2.5, 7}}, Ticks -> {{1, 2, 3, 4}, None}, AxesStyle -> Thin, TicksStyle -> Directive[Black, Bold, 12], Mesh -> Full, Epilog -> { Line[ ...

dynamic - How can I make a clickable ArrayPlot that returns input?

I would like to create a dynamic ArrayPlot so that the rectangles, when clicked, provide the input. Can I use ArrayPlot for this? Or is there something else I should have to use? Answer ArrayPlot is much more than just a simple array like Grid : it represents a ranged 2D dataset, and its visualization can be finetuned by options like DataReversed and DataRange . These features make it quite complicated to reproduce the same layout and order with Grid . Here I offer AnnotatedArrayPlot which comes in handy when your dataset is more than just a flat 2D array. The dynamic interface allows highlighting individual cells and possibly interacting with them. AnnotatedArrayPlot works the same way as ArrayPlot and accepts the same options plus Enabled , HighlightCoordinates , HighlightStyle and HighlightElementFunction . data = {{Missing["HasSomeMoreData"], GrayLevel[ 1], {RGBColor[0, 1, 1], RGBColor[0, 0, 1], GrayLevel[1]}, RGBColor[0, 1, 0]}, {GrayLevel[0], GrayLevel...

Is there a way to do conditional matrix loop using 'continue'

I have the following: n = 3; m = 5; ww = RandomReal[{0, 0.1}, {n, n}]; uu = RandomReal[{0, 1}, {m, n}]; pp = RandomReal[{0, 1}, {n, n}]; ss = RandomInteger[{0, 5}, {m, n}]; Grid[{{"ww", "uu", "pp", "ss"}, {ww // TableForm, uu // TableForm, pp // TableForm, ss // TableForm}}, Spacings -> {5, 2}, Dividers -> All] where I would like to look at every element of matrix ss and produce a matrix tt , with zeroes at the locations in ss which have zeroes, and in all other positions do the following: tt = (-1/Subscript[ww, m]) Log[(1 - uu)/(Subscript[pp, m - 1])], where Subscript[ww, m] is the value at index of ww matrix and where Subscript[pp, m - 1] is the value at index-1 of pp matrix. So for example if the first value ever read from matrix ss happens to be 2, then value taken from matrix ww would be from the row 2, but from pp would be from row 1. Also how to tell difference between a 0 as a valid value from within the matrix elemen...