Shortest zookeeper's routes in simple polygons
2001; Elsevier BV; Volume: 77; Issue: 1 Linguagem: Inglês
10.1016/s0020-0190(00)00144-7
ISSN1872-6119
Autores Tópico(s)Advanced Image and Video Retrieval Techniques
ResumoLet P be a simple polygon, and let P be a set of disjoint convex polygons inside P, each sharing one edge with P. The zookeeper's route problem asks for a shortest route inside P that visits (but does not enter) each polygon in P. We present an O(n2) time algorithm for computing a shortest zookeeper's route, on which no starting point is specified.
Referência(s)