14 search results - page 3 / 3 » On minimum reload cost paths, tours and flows |
102
click to vote
Publication
In this paper, we propose a new variational framework for computing continuous curve skeletons from discrete objects that are suitable for structural shape representation.
We have...
SIAMCOMP
2008
13 years 5 months ago
2008
Our goal is to find an approximate shortest path for a point robot moving in a planar subdivision with n vertices. Let 1 be a real number. Distances in each face of this subdivis...
ICCV
2007
IEEE
13 years 11 months ago
2007
IEEE
In this paper, we propose a new variational framework for computing continuous curve skeletons from discrete objects that are suitable for structural shape representation. We have...
TASE
2010
IEEE
13 years 1 days ago
2010
IEEE
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...