[font=courier new][size=8pt]I looked at it a little, here.
http://www.programmersheaven.com/2/perlin
For 2D, it talks about a point, and its four neighbors. Using the analogy of a chessboard, I guess that an interior black square's four neighbors, would be the four red squares adjacent to it.
As far as I know, an area is perfectly tileable for a particular pattern, if the entire area can be covered, just by repeating the pattern. But, in that case, any m x n area, is perfectly tileable using the chessboard pattern, not only areas of the form, 2n x 2n.
(I already looked at your Ken Perlin link (just below). I didn't see anything about, "perfectly tileable". But, maybe I didn't look closely enough.)
||
||
\/
The relevant concepts, "Perlin Noise", "perfectly tileable", are not clear enough in my head, for me to say anything that might be helpful.
Bookmarks