Unobstructed shortest paths in polyhedral environments | lit.salon