Optimally computing a shortest weakly visible line segment inside a simple polygon Article

Bhattacharya, BK, Das, G, Mukhopadhyay, A et al. (2002). Optimally computing a shortest weakly visible line segment inside a simple polygon . 23(1), 1-29. 10.1016/S0925-7721(01)00058-X

Industry Collaboration International Collaboration

keywords

  • Mathematics
  • Mathematics, Applied
  • OPTIMAL ALGORITHM
  • PATH
  • Physical Sciences
  • Science & Technology
  • TIME
  • VISIBILITY
  • simple polygons
  • triangulations
  • weak visibility
  • weakly internally visible

Digital Object Identifier (DOI)

start page

  • 1

end page

  • 29

volume

  • 23

issue

  • 1