Sciweavers

763 search results - page 53 / 153
» Engineering Shortest Path Algorithms
Sort
View
IEEEMSP
2002
IEEE
14 years 19 days ago
An optimal shape encoding scheme using skeleton decomposition
—This paper presents an operational rate-distortion (ORD) optimal approach for skeleton-based boundary encoding. The boundary information is first decomposed into skeleton and di...
Haohong Wang, Guido M. Schuster, Aggelos K. Katsag...
IWDC
2005
Springer
138views Communications» more  IWDC 2005»
14 years 1 months ago
Hierarchical Routing in Sensor Networks Using k-Dominating Sets
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, calle...
Michael Q. Rieck, Subhankar Dhar
ICRA
2010
IEEE
106views Robotics» more  ICRA 2010»
13 years 6 months ago
Computing push plans for disk-shaped robots
Suppose we want to move a passive object along a given path, among obstacles in the plane, by pushing it with an active robot. We present two algorithms to compute a push plan for...
Mark de Berg, Dirk H. P. Gerrits
EUROGRAPHICS
2010
Eurographics
14 years 4 months ago
Procedural Generation of Roads
In this paper, we propose an automatic method for generating roads based on a weighted anisotropic shortest path algorithm. Given an input scene, we automatically create a path co...
Eric Galin, Adrien Peytavie, Nicolas Maréchal, Er...
ACRI
2006
Springer
14 years 1 months ago
A Maze Routing Algorithm Based on Two Dimensional Cellular Automata
This paper propose a maze routing algorithm based on cellular automata. The aim of this algorithm is find the shortest path between the source cell and the target cell , so that th...
Shahram Golzari, Mohammad Reza Meybodi