Finding an Approximate Minimum-Link Visibility Path Inside a Simple Polygon

Muhammad H. Alsuwaiyel, D. T. Lee. Finding an Approximate Minimum-Link Visibility Path Inside a Simple Polygon. Inf. Process. Lett., 55(2):75-79, 1995. [doi]

@article{AlsuwaiyelL95,
  title = {Finding an Approximate Minimum-Link Visibility Path Inside a Simple Polygon},
  author = {Muhammad H. Alsuwaiyel and D. T. Lee},
  year = {1995},
  doi = {10.1016/0020-0190(95)00072-K},
  url = {http://dx.doi.org/10.1016/0020-0190(95)00072-K},
  researchr = {https://researchr.org/publication/AlsuwaiyelL95},
  cites = {0},
  citedby = {0},
  journal = {Inf. Process. Lett.},
  volume = {55},
  number = {2},
  pages = {75-79},
}