Reputation
7,957
Top tag
Next privilege 10,000 Rep.
Access moderator tools
Badges
1 18 45
Newest
 Yearling
Impact
~147k people reached

Mar
31
comment Low resolution with RegionPlot3D
@JasonB You are right. We can close it.
Mar
31
comment Low resolution with RegionPlot3D
@J.M. Not until now. Thanks.
Mar
31
comment Low resolution with RegionPlot3D
Ok. But now we are actually back to the original issue, where we had to turn PlotPoints up to get a decent plot.
Mar
31
comment Low resolution with RegionPlot3D
Graphically looks ok, but I don't think it solves my problem. How would you obtain the difference between objects? I'm usually using the difference between two objects to obtain a hollow object that can be then 3D printed.
Mar
31
comment Low resolution with RegionPlot3D
Nice and quick. The only drawback is that with this approach is not possible to use CSG operations (union, difference, intersection between objects). For example, this union operation fails: RegionPlot3D[ cuboidQ3[25, 35, 17, {15, 5, -5}, \[Pi]/7, {1, 1, 1}] || cuboidQ3[25, 35, 17, {15, 5, -5}, \[Pi]/2, {1, 1, 1}], Axes -> True, PlotRange -> {{-50, 50}, {-50, 50}, {-50, 50}}]
Mar
30
comment Low resolution with RegionPlot3D
@JasonB I have already 3D printed this kind of objects (the cuboidQ non-rotated version) and with PlotPoints set to 250 they looked great.
Mar
30
comment Low resolution with RegionPlot3D
@MartinBüttner Argh. Yes, it works.
Jun
25
comment How to obtain all the distinct De Bruijn sequences?
Thanks for your contribution, but FindHamiltonianCycle on MMA 8 accepts only undirected graphs, so, unfortunately, this approach doesn't work for me.
Jun
25
comment How to obtain all the distinct De Bruijn sequences?
@rasher With FindHamiltonianCycle[DeBruijnGraph[3, 1], 24] I get the following warning: "The method currently implemented for FindHamiltonianCycle only accepts undirected graphs".
Jun
25
comment How to obtain all the distinct De Bruijn sequences?
This works for DeBruijnGraph[3,1], but it get stuck for DeBruijnGraph[4,1]. There are too many possible permutations I guess. There must be another way that is less memory demanding.
Jun
25
comment How to obtain all the distinct De Bruijn sequences?
@mfvonh Just out of curiosity, does it work on MMA 9 if you run: FindEulerianCycle[DeBruijnGraph[4, 1], 20736]?
Jun
24
comment How to obtain all the distinct De Bruijn sequences?
So it is probably a bug of version 8 which I'm also running. It would be great to find a workaround though.
Oct
4
comment Finding the best way to visualize rather complicated data
@Vaggelis_Z See update.
Sep
16
comment Accessing data on local machine from remote kernel
@ybeltukov I don't know if it works, but did you try to follow all the steps above and then simply Export["!ssh localuser@111.111.111.11 cat /Users/localuser/Desktop/newfile.txt", data, "TSV"], where data is the dataset you want to export?
Aug
28
comment How to print coordinates above certain points
@Sosi To remove the curly brackets replace this: Text[ToString[coords[[i]]] with Text[ToString[coords[[i, 1]]] <> " " <> ToString[coords[[i, 2]]]. In this way, only the numbers are converted to strings and an extra place is added between them. The <> stands for StringJoin.
Aug
9
comment How to create a simple cross eyed 3d plot
Another solution, the StereoImagery package contains two main functions, MakeStereo and MakeAnaglyph: markfisher.net/~mefisher/mma/mathematica.html
Jul
18
comment Connecting to remote kernel on iMac from a MacBook Pro client
There might be several reasons why it doesn't work, could you expand your question with all the steps you took?
Mar
20
comment X-Y scatter plot with coloring dependent on Z value
Similar question: mathematica.stackexchange.com/q/21130/685
Mar
19
comment Exporting large numbers to a text file
You can use NumberForm with the option ExponentFunction: NumberForm[123456.789, {20, 3}, ExponentFunction -> (Null &)]
Mar
18
comment How can I invert the colors in a color bar
Try replacing colorbar[valrange, cf] with colorbar[valrange, ColorData[cf][1 - #] &] at the end of your example.