Approximation algorithms for tours of orientation-varying view cones
Lists
Only you see this
Abstract
This article considers the problem of finding a shortest tour to visit viewing sets of points on a plane. Each viewing set is represented as an inverted view cone with apex angle α and height h. Th...
BibTeX
@article{stefas2020approximation,
author = {Nikolaos Stefas and Patrick A. Plonski and Volkan Isler},
title = {{Approximation algorithms for tours of orientation-varying view cones}},
journal = {Int. J. Robotics Res.},
year = {2020},
doi = {10.1177/0278364919893455},
}Loading related content...