Login / Signup

Computing a Shortest Watchman Path in a Simple Polygon in Polynomial-Time.

Svante CarlssonHåkan Jonsson
Published in: WADS (1995)
Keyphrases
  • simple polygon
  • shortest path
  • endpoints
  • convex hull
  • computer vision
  • special case
  • image processing
  • viewpoint
  • path length