24 search results - page 1 / 5 » Distance-Preserving Approximations of Polygonal Paths |
174
click to vote
FSTTCS
2003
Springer
16 years 6 days ago
2003
Springer
Given a polygonal path P with vertices p1, p2, . . . , pn and a real number t ≥ 1, a path Q = (pi1 , pi2 , . . . , pik ) is a t-distance-preserving approximation of P if 1 = i1 &...
182
Voted
CCCG
2010
15 years 8 months ago
2010
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...
170
Voted
COMPGEOM
1998
ACM
15 years 11 months ago
1998
ACM
157
click to vote
ISAAC
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. Let C be a polygonal cycle on n vertices in the plane. A randomized algorithm is presented which computes in O(n log3 n) expected time, the edge of C whose removal result...