Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Approximating a shortest watchman route

Nilsson B.J.

Fundamenta Informaticae

2001

Vol. 45, nr 3

253-281

We present a fast algorithm for computing a watchman route in a simple polygon that is at most a constant factor longer than the shortest watchman route. The algorithm runs in O(nlogn) time as compared to the best known algorithm that computes a shortest watchman route which runs in O(n6) time.