Sciweavers

DCG
2000
104views more  DCG 2000»
13 years 11 months ago
Efficient Algorithms for Approximating Polygonal Chains
We consider the problem of approximating a polygonal chain C by another polygonal chain C whose vertices are constrained to be a subset of the set of vertices of C. The goal is to ...
Pankaj K. Agarwal, Kasturi R. Varadarajan
COR
2006
94views more  COR 2006»
13 years 11 months ago
Computing obnoxious 1-corner polygonal chains
We consider an obnoxious facility location problem in which the facility is a trajectory consisting of a bounded length polygonal chain of two edges having extremes anchored at tw...
José Miguel Díaz-Báñez...