5 ms·
Search in Google following for Batman: 2 sqrt(-abs(abs(x)-1)*abs(3-abs(x))/((abs(x)-1)*(3-abs(x))))(1+abs(abs(x)-3)/(abs(x)-3))sqrt(1-(x/7)^2)+(5+0.97(abs(x-
by avinassh 12y ago
Search in Google following for Batman:
2 sqrt(-abs(abs(x)-1)*abs(3-abs(x))/((abs(x)-1)*(3-abs(x))))(1+abs(abs(x)-3)/(abs(x)-3))sqrt(1-(x/7)^2)+(5+0.97(abs(x-.5)+abs(x+.5))-3(abs(x-.75)+abs(x+.75)))(1+abs(1-abs(x))/(1-abs(x))),-3sqrt(1-(x/7)^2)sqrt(abs(abs(x)-4)/(abs(x)-4)),abs(x/2)-0.0913722(x^2)-3+sqrt(1-(abs(abs(x)-2)-1)^2),(2.71052+(1.5-.5abs(x))-1.35526sqrt(4-(abs(x)-1)^2))sqrt(abs(abs(x)-1)/(abs(x)-1))+0.9
link to the same: http://bit.ly/1G0rLgk http://bit.ly/1G0rLgk
- UUMMUU 12y agoIt's not the plot we deserved but the plot we needed.
- teh_klev 12y agoNow I challenge you to drop in the Eye of Sauron :)
- tehmaco 12y agoWolfram Alpha didn't recognise "Eye of Sauron": https://www.wolframalpha.com/input/?i=graph+looks+like+Sauron https://www.wolframalpha.com/input/?i=graph+looks+like+Sauro...
- BMarkmann 12y agoWolfram Alpha does a pretty amazing job of taking an existing graphic and turning back into a graph-able equation... eg: http://www.wolframalpha.com/input/?i=graph+looks+like+batman http://www.wolframalpha.com/input/?i=graph+looks+like+batman http://www.wolframalpha.com/input/?i=graph+looks+like+bart+simpson http://www.wolframalpha.com/input/?i=graph+looks+like+bart+s...
- acadien 12y agoI feel like these are special cased, searching for: graph looks like <object> with any random object turns up junk. Edit: then again it does work with Obama but not with Richard Nixon.
- garethadams 12y agohttp://www.wolframalpha.com/input/?i=popular+curves http://www.wolframalpha.com/input/?i=popular+curves
- mw67 12y agoHow can one come up with the exact equation to match such an exact drawing? i'm impressed. is it just tons of trial and errors?
- Too 12y agoAny continuous function can be described as a sum of sinus-functions with different amplitude and frequencies, given that the maximum frequency is limited. Finding these amplitudes can be done quite easily using something called discrete fourier transform. A lot of audio and imaging technology is based on this theory, jpeg compression for example, and almost any audio and signal-processing.
- xyzzyz 12y agoThe downside is that very few mathematically interesting functions have limited frequency. While this is not a problem for signal processing, as our senses usually cannot sense the difference, in math it's very easy to see the difference even if you cut off at really high frequencies: http://upload.wikimedia.org/wikipedia/commons/d/d4/Synthesis_sawtooth.gif http://upload.wikimedia.org/wikipedia/commons/d/d4/Synthesis... In other words, if one tried to do the Batman curve using Fourier transform, the formula to get sub-pixel consistency would be extremely long.
- darkmighty 12y agoThis is easily solved in practice by segmentation. Images are segmented in blocks, and each small block can be well approximated by a low frequency content, but block boundaries can contain discontinuities. If you look at the wolfram alpha source, that's exactly how those images are constructed -- they are combinations low frequency segments, most likely obtained through fourier analysis. Another trick used in frequency domain compression is they don't impose a hard cut-off of frequencies (truncation); instead they specify weights according to image quality, and lower are assigned to high frequencies, and those weights control the precision of each frequency. All this works because real signals happen to be concentrated in certain frequencies, with a few discontinuities in between.
- 12y ago
- acoravos 12y agoHahaha, this made. my. day.