On 28 April 2011 22:56, Luke wrote:
> I am thinking that perhaps the approach I should be taking should
> involve contouring the real part of the eigenvalues which determine
> the stability, and then plot the zero-level curve. I'll have to think
> about that some more.
>
This sounds like a very
On 4/28/11 9:03 PM, gary ruben wrote:
> http://stackoverflow.com/questions/1920145/how-to-find-duplicate-elements-in-array-using-for-loop-in-python-like-c-c
> i.e.
> dups = [x for x in list_a if list_a.count(x)> 1]
That involves iterating through your list_a a number of times to look
for element
If you generate a big list of all the edges from the triangle data,
you should get repeat entries only for all the internal edges. You
could then find all the duplicates using this recipe
http://stackoverflow.com/questions/1920145/how-to-find-duplicate-elements-in-array-using-for-loop-in-python-lik
Ian,
Thanks for the response and the example code. I guess what I'm
trying to do might be well defined. Here is a plot that should
illustrate the data I'm working with:
http://biosport.ucdavis.edu/blog/copy_of_steady_benchmark_tau.png
The green and red regions are being displayed by plotting
On 28 April 2011 08:51, Luke wrote:
> I have a set of unstructured (x,y) points which I would like to
> compute a boundary polygon for. I don't want the convex hull.
>
> I was able to use matplotlib.tri to get a Delaunay triangulation for
> my points by following the examples online, but I'm hav
I have a set of unstructured (x,y) points which I would like to
compute a boundary polygon for. I don't want the convex hull.
I was able to use matplotlib.tri to get a Delaunay triangulation for
my points by following the examples online, but I'm having trouble
masking everything but the triangle
