Back to Search
Start Over
Minsum m watchmen’s routes in Stiegl polygons
- Publication Year :
- 2023
-
Abstract
- We present an O(n2 · min{m, n}) time and O(n · min{m, n}) storage algorithm to compute the minsum set of m watchmen routes given their starting points in a Stiegl polygon ― a staircase polygon where the floor solely consists of one horizontal and one vertical edge ― with n vertices.
Details
- Database :
- OAIster
- Notes :
- application/pdf, English
- Publication Type :
- Electronic Resource
- Accession number :
- edsoai.on1416066194
- Document Type :
- Electronic Resource