66 search results - page 4 / 14 » cccg 2010 |
CCCG
2010
13 years 7 months ago
2010
So far, the best result in running time for solving the fixed watchman route problem (i.e., shortest path for viewing any point in a simple polygon with given start point) is O(n3...
CCCG
2010
13 years 7 months ago
2010
In the Euclidean TSP with neighborhoods (TSPN), we are given a collection of n regions (neighborhoods) and we seek a shortest tour that visits each region. In the path variant, we...
CCCG
2010
13 years 7 months ago
2010
We prove several new results concerning k-sets of point sets on the 2-sphere (equivalently, for signed point sets in the plane) and k-sets in 3-space. Specific results include sph...
CCCG
2010
13 years 7 months ago
2010
A watchman tour in a polygonal domain (for short, polygon) is a closed curve such that every point in the polygon is visible from at least one point of the tour. The problem of fin...
CCCG
2010
13 years 7 months ago
2010
Three types of geometric structure--grid triangulations, rectangular subdivisions, and orthogonal polyhedra-can each be described combinatorially by a regular labeling: an assignm...