I would like to see a function like Point Distance implemented, but adjusting distance based on polygon obstructions. The idea would be similar to a cost path for grids, but working on the basis of vector geometries, and generating a matrix of output values. The distance matrix could then be fed into other operations (e.g. advanced spatial sorting and clustering). Note - this is a little different from a Network Analyst problem in that the points aren't connected by routes (unless you want to create a visibility graph and apply Dijkstra's algorithm, in which case the request would be for tools that could construct such a visibility graph efficiently from point locations and polygon obstacles).