17 search results - page 2 / 4 » Euclidean TSP on two polygons |
139
click to vote
NCA
2008
IEEE
15 years 10 days ago
2008
IEEE
The paper focuses on the study of solving the large-scale traveling salesman problem (TSP) based on neurodynamic programming. From this perspective, two methods, temporal differenc...
100
Voted
LATIN
1998
Springer
15 years 4 months ago
1998
Springer
Abstract. Automatic graph drawers need to compute paths among vertices of a simple polygon which besides remaining in the interior need to exhibit certain aesthetic properties. Som...
107
Voted
PSIVT
2007
Springer
15 years 6 months ago
2007
Springer
Let p and q be two points on the surface of a polytope Π. This paper provides a rubberband algorithm for computing a Euclidean shortest path between p and q (a so-called surface E...
96
Voted
FSTTCS
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Given two simplicial complexes C1 and C2 embedded in Euclidean space IRd , C1 subdivides C2 if (i) C1 and C2 have the same underlying space, and (ii) every simplex in C1 ...
81
Voted
STOC
2001
ACM
16 years 20 days ago
2001
ACM
Two infinite families of self-similar tilings are described which have apparently not been reported before. Each tiling is based on a single prototile that is a segment of a regul...