Hi, I'm drawing a warehouse in 2d. It's really simple: just a rectangle with squares (representing the shelves). My question is: given a few points inside the warehouse (let's say 20 points), how can I get a matrix or something, that gives me the shortest (but posible) distance between every point? I say posible because I dont want to have the euclidean distances, but the real distances that represent the path that a person can walk ?


Thanks a lot!

Andres

thank you for your reply... the problem is that i have about 70 nodes (points) inside the warehouse, and i was looking for a way to do this automatically, rather than doing about 2.500 dist2 attempts.... (70*70 / 2) .....

any suggestions?


ps: i downloaded the dist2 addon.... how do i "install" it ? ...sorry I'm kind of new at this...