Questions and postings pertaining to the usage of ImageMagick regardless of the interface. This includes the command-line utilities, as well as the C and C++ APIs. Usage questions are like "How do I use ImageMagick to create drop shadows?".

This should find all the overlaps. Considering how repeative this game appears in it world generation, a lot of false matches are likly, unless you have a rough idea of the order in which images will overlap.

Snibo I can see how the 3 and 4 images overlap, though it isn't by very much.

And WOW.. your site has continued to develop in a lot of areas. Love to see some of that work incorperated into IM Examples, but I have no time to devote to that. I will be studying your stuff a lot more however.

Ah, yes, I now see that #3 joins to the right of #1, and #4 joins to the right of #3. The overlaps are too small for my script to find. I wrote whatTrans.bat for adjacent video frames, or still photos, with much larger overlaps (and where no perfect match will be found).

Feel free to adapt anything on my pages for your invaluable IM Examples. I keep thinking of new things I want to add, but not enough time. Sigh.

The output image is merged_001.png .... merged_003.png
with each merger hadding one more 'match', and the script using that last output for testing it against the next image in the list.

In other words the first command is equivlent to
overlap image_1.png image_2.png
overlap merged_001.png image_3.png
overlap merged_002.png image_4.png

Adding a -v will display verbose information of the points and offsets it find and uses to attempt a match, it only thinks it succeeds if three identical matches from the second image are found in the first image for each image being merged.

Points searched for are high entropy points that are as widly spaced across the image as posible. That is first will be in one corner, The next attempt second will be based on a high entropy point in another corner, and so on. This means it may have to go though a 10 or more attempts before it find the 3 matches.

There are options to specify a single 'high entropy' point, the radius around that point, or a area that overlaps, that is located in the second image, to search for in the first image to find the 'overlap'.

I found it works very well, and not too slow. However remember this is ment only for images which match almost perfectly, and only differ by a integer translation (offset).

Fo an example of results of this script see...
Note the haphazard way in which the overlapping maps 'fitted' together, sometimes with gaps. The script failed with some ocean maps (not many entropy points) but corrected itself when other maps linked the ocean shores around the edge.

Aside the game is minecraft, and I pretty well mapped all of this area myself.

Now in-game maps are arranged as a grid without overlaps, so I don't use the 'overlap' script as much as I used to.
For example.. Grid (appened) map in later games.

The commands used in my script was discussed in the thread previously mentioned, though it is mostly about finding a set of well distributed high entropy points as a center point for small sub-image searches. That is using a 'distance gradient' generated from previously seen points, and merging it with the high-entropy edges to figure out the next high entropy point to use.

There is no reason why this could not be done in DOS, but getting someone to write it is a completely different matter.