Unobstructed Shortest Paths in Polyhedral Environments | lit.salon