Remix.run Logo
Largest-Triangle-Three-Buckets and the Fourier Transform (2024)(daniel.mitterdorfer.name)
19 points by wonger_ 5 days ago | 6 comments
tonyarkles 38 minutes ago | parent | next [-]

With respect to the frequency changing as the signal's downsampled, I'm pretty sure the author isn't correctly keeping track of the fact that by having fewer samples they're effectively changing the sample rate. It looks like the FFT every time is using 2048 bins, which is somewhat unexpected. They're not documenting how they're taking a 2048-point FFT with fewer than 2048 samples. Otherwise, fantastic article!

sevensor 3 hours ago | parent | prev | next [-]

> sine waves and provides the amplitude and frequency of each sine wave.

And phase! Good luck trying to reconstruct your signal after you discard the phase. Lest you object that nobody would do this: I’ve seen people actually try to do this, and they couldn’t make sense of the garbage that resulted.

srean 3 hours ago | parent | prev | next [-]

https://en.wikipedia.org/wiki/Ramer%E2%80%93Douglas%E2%80%93...

is an alternative if visuals are all that matters. It can and will rain havoc in the Fourier space.

r--w an hour ago | parent | prev | next [-]

Fortunately, if you’re a ClickHouse user, you can use the built-in function `largestTriangleThreeBuckets(n)(x, y)`.

toddwprice an hour ago | parent | prev | next [-]

If stuck on a desert island with only one algorithm in my bag, I’d wish for the Fourier. At least I would die happy.

kohlerm 3 hours ago | parent | prev [-]

It is definitely a real problem to be solved. We used something similar in an IOT application some time ago