Question

I have a two dimensional array of points, which constitute a map. The black pixels mark where the walls are.Each of those points is marked as either wall or empty. Is there an algorithm to find the important points, such as corners and where walls end?Take the following two images for example:

This is the graph I have:

And this is the result I want:

Then I could take those significant points to create a graph of the wall, instead of having to keep track of every pixel.

Answer 1

I think you need a corner detection filter. Here’s a good reference, with some sample code in Java: http://users.ecs.soton.ac.uk/msn/book/new_demo/corners/