Geographic Information Systems Stack Exchange is a question and answer site for cartographers, geographers and GIS professionals. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

There are many algorithms for binary map overlay operation in vector data format which take two layers of map and produce resultant layer i.e overlaid layer as output. I am wondering whether there are any algorithms which take more than two layers say 3 layers simultaneously and produce the overlay result?

share|improve this question

The low-level spatial predicate operators are all binary—i.e., compare geometry A to geometry B. For example, see the DE-9IM topological model, which is the basis for Intersects, Contains, etc. When you have more than two, say geometry C, then you might need to compare the combinations of geometries: AB, AC, BC. But it all really depends on what you are trying to determine.

For a specific coded example of how you handle more than two geometries, see Polygon overlay with Shapely. This example also features a cascaded union, which unions several (more than two) geometries, so I guess is a good example of an efficient map algorithm that take takes more than two inputs.

share|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.