Unobstructed Shortest Paths in Polyhedral Environments