Learn More

Assume that two points p and q are given and a finite ordered set of simple polygons, all in the same plane; the basic version of a touring-a-sequence-of-polygons problem (TPP) is to find a shortest path such that it starts at p, then visits these polygons in the given order, and ends at q. This paper describes four approximation algorithms for… (More)

- Fajie Li, Xiuxia Pan
- ACCV
- 2010

- ‹
- 1
- ›