“…As before, the input to our problem is a polygonal domain P with a source and a sink m gives the weather impact interaction grid, as discussed in [Lindholm, et al, 2009].) The capacity estimation problem is: Given integers n 1 , n 2 , n 3 , ..., n M , decide if there exist n 1 class-1 paths, n 2 class-2 paths,..., and n M class-M paths from source to sink through P, with no overlap among the (thick) paths, and each class-m path avoiding constraints of types in the set O m .…”