Reputation
23,515
Next tag badge:
185/100 score
17/20 answers
Badges
2 61 116
Newest
 Good Answer
Impact
~363k people reached

Oct
6
awarded  Nice Answer
Oct
5
comment Graphics3D not rendering Ball as a filled object
@m_goldberg Show[{DiscretizeRegion[Ball[],{{0,1},{0,1},{0,1}}],Graphics3D[Sphere[]]}] works fine for me. I really don't understand your object to the answer at all. Regardless, the assertion that it's not relevant seems patently false.
Oct
4
comment Graphics3D not rendering Ball as a filled object
@m_goldberg Well, you asked if it was a bug. I replied "this is a minor bug" with explanation as to why I consider it to be minor and suggested a workaround.
Oct
3
comment StreamPlot for Bifurcation Diagram
@Stephen I'm glad you found the code useful! It sounds like you might need to incorporate a SaveDefinitions option into your code, if you want the dynamic content to work when you open the notebook. It's hard to say for sure, though, without seeing your code.
Sep
30
awarded  Explainer
Sep
30
answered Graphics3D not rendering Ball as a filled object
Sep
27
comment Enumerating all connected graphs with 9 vertices
Should be faster if you use FindIsomorphism[g,g,All] on a Graph object. On my iPhone right now so I can't try it just now.
Sep
27
comment Fitting ellipse to 5 given points on the plane
@Jens My assumption is that the OP simply wants to add more points that are know to be on the same ellipse, rather than find a best fit.
Sep
27
comment Fitting ellipse to 5 given points on the plane
@user153012 If you'd like to plot more points in a list, say morePoints, simply add another Point primitive containing your list to the Epilog.
Sep
27
awarded  Nice Answer
Sep
27
comment Enumerating all connected graphs with 9 vertices
@EdenHarder I believe the Graph6 representation of a graph depends on the ordering of the vertices and, as such, is not unique so there's no reason to expect "HhcWJEA" to be on that list. Presumably, one of the automorphisms of your graph leads to your g6 code.
Sep
27
comment Plotting Semi-hollow spheres
In light of the post of @belisarius, I wonder if the answers here contributed significantly to your cover image? If so, attribution (which I don't see, but might have missed in the article) would be appropriate.
Sep
27
answered Fitting ellipse to 5 given points on the plane
Sep
27
comment Enumerating all connected graphs with 9 vertices
getConnG[7] in about 6 minutes.
Sep
27
comment Bifurcation diagrams for multiple equation systems
@belisarius I saw that question but was not quite able to figure a good way to approach it. At least, not given the kind of time I've got these days!
Sep
27
comment Enumerating all connected graphs with 9 vertices
I modified your code slightly so that getConnG[6] runs in 5 seconds as opposed to 30 seconds on my machine. The major point is that DeleteDuplicates has quadratic time complexity when using a user defined comparison function. Thus, breaking the list of graphs in smaller parts using the total number of edges helps a lot. Of course, DeleteDuplicates can run like $n\log(n)$, when the data is linearly ordered, but that's not generally possible with a user defined comparison function.
Sep
27
revised Enumerating all connected graphs with 9 vertices
added 98 characters in body
Sep
24
awarded  Autobiographer
Sep
24
comment What's wrong in FunctionPeriod?
I don't think this is a duplicate, as the other question predates FunctionPeriod. Also, while FunctionPeriod builds on the Periodic context, there are differences. I guess I'd say it's a bug but I doubt that it's a very high priority bug.
Sep
24
revised What's wrong in FunctionPeriod?
added 199 characters in body