Reputation
11,896
Next privilege 15,000 Rep.
Protect questions
Badges
1 17 68
Newest
 Nice Answer
Impact
~131k people reached

Feb
13
revised Drawing a Gradient Between Two Circular Arcs
deleted 53 characters in body
Feb
13
answered Drawing a Gradient Between Two Circular Arcs
Feb
11
comment Automatically convert pairs of directed edges to an undirected edge?
Mr.Wizard You are indeed perceptive. Yes, I was.
Feb
11
comment Automatically convert pairs of directed edges to an undirected edge?
+1 for using Union instead of Sort and Union
Feb
11
comment Automatically convert pairs of directed edges to an undirected edge?
Would you clarify how /. {{_[a_, b_], __} :> a <-> b, {x_} :> x} works? I don't fully understand _[a_, b_] but it seems to be an opaque variation of belisarius' Rule[a_,b_].
Feb
10
comment LinearModelFit[] of simulated data
One possible title: "How do I simulate raw data (with measurement error) from a known function?"
Feb
8
revised How to make a cylinder with bottom that shows hidden part of edge as dashed curve
added 138 characters in body
Feb
8
answered How to make a cylinder with bottom that shows hidden part of edge as dashed curve
Feb
8
comment Using GraphData to generate all directed graphs with n vertices
A generalization of your method for labeling: graphs[n_] := Module[{c, cb}, c = GraphData["Connected", n]; cb = GraphData[#, "EdgeRules"] & /@ c; Row[Column[GraphData[#, {"StandardName", "Image"}]] & /@ c, Spacer[10]]]
Feb
8
revised Using GraphData to generate all directed graphs with n vertices
added 181 characters in body
Feb
8
revised Using GraphData to generate all directed graphs with n vertices
added 37 characters in body
Feb
8
comment Using GraphData to generate all directed graphs with n vertices
+1 Nice use of graph names, "Connected", and isomorphism.
Feb
7
revised Using GraphData to generate all directed graphs with n vertices
added 537 characters in body
Feb
7
revised Using GraphData to generate all directed graphs with n vertices
added 537 characters in body
Feb
7
answered Using GraphData to generate all directed graphs with n vertices
Feb
5
comment Finding a “not-shortest” path between two vertices
My goodness, this really does work. I never used FindPath and am curious to get a sense of how it works.
Jan
29
comment Can Mathematica Handle Open Intervals? Interval complements?
I used Mathematica v.9 (or v. 8). I must have drawn everything "by hand". If I were to do it with v.10, I would use NumberLinePlot[{{-\[Infinity] < x < -2, -1 < x <= 1, 4 < x <= Pi^2}}, x] and so forth.
Jan
28
comment Find intersecting rectangles groups
I assume that means that the empty region is indeed a region.
Jan
28
comment TransformedRegion, RegionPlot broken in 10.0.2.0?
You must be Jinxed.
Jan
24
revised Animate point going around a triangle
complete rewrite