It seems that you're using an outdated browser. Some things may not work as they should (or don't work at all).
We suggest you upgrade newer and better browser like: Chrome, Firefox, Internet Explorer or Opera

×
I posted this on the jMonkey programming forums as well, but I thought some of the math-inclined people here might be able to help as well.



So, I decided to research Perlin noise for the heightmap generator I’m making. My discovery? It’s over my head. But one thing I took away from my research is that adding together noise will result in a fairly convincing-looking heightmap, provided the noise is “blurred” so that there aren’t any rough edges. And therein lies my problem. Although I have a blurring function (it basically samples all the points surrounding a given point on the heightmap and averages them), it doesn’t seem to be sufficient. So I’m hoping to get some sort of bilinear interpolation algorithm working. I found these links:

http://en.wikipedia.org/wiki/Bilinear_interpolation

http://devmag.org.za/2009/04/25/perlin-noise/

http://freespace.virgin.net/hugo.elias/models/m_perlin.htm

Problem is, the Wikipedia article is basically Egyptian to me, and the other two don’t really explain how bilinear interpolation would actually work. So I was wondering if anyone could help me out a little. How exactly does Bilinear Interpolation work (the “for dummies” version)?
Post edited August 04, 2012 by jefequeso
No posts in this topic were marked as the solution yet. If you can help, add your reply