Results 1  10
of
11,957
Rectilinear Paths among Rectilinear Obstacles
 Discrete Applied Mathematics
, 1996
"... Given a set of obstacles and two distinguished points in the plane the problem of finding a collision free path subject to a certain optimization function is a fundamental problem that arises in many fields, such as motion planning in robotics, wire routing in VLSI and logistics in operations resear ..."
Abstract

Cited by 31 (3 self)
 Add to MetaCart
research. In this survey we emphasize its applications to VLSI design and limit ourselves to the rectilinear domain in which the goal path to be computed and the underlying obstacles are all rectilinearly oriented, i.e., the segments are either horizontal or vertical. We consider different routing
Rectilinear Path Problems Among Rectilinear Obstacles Revisited
, 1995
"... . We present efficient algorithms for finding rectilinear collisionfree paths between two given points among a set of rectilinear obstacles. Our results improve the time complexity of previous results for finding the shortest rectilinear path, the minimumbend shortest rectilinear path, the shortes ..."
Abstract

Cited by 16 (3 self)
 Add to MetaCart
. We present efficient algorithms for finding rectilinear collisionfree paths between two given points among a set of rectilinear obstacles. Our results improve the time complexity of previous results for finding the shortest rectilinear path, the minimumbend shortest rectilinear path
www.ijera.com Development of Rectilinear Path for a Limbless Robot
"... Abstract: This paper describes the research carried out on limbless robot and the results of experiments conducted with wheelless snake inspired robots. This develops a kinematic and dynamic model for rectilinear path. A model using Eulerian framework and coulomb friction yields torque expressions ..."
Abstract
 Add to MetaCart
Abstract: This paper describes the research carried out on limbless robot and the results of experiments conducted with wheelless snake inspired robots. This develops a kinematic and dynamic model for rectilinear path. A model using Eulerian framework and coulomb friction yields torque expressions
Spanning Ratio and Maximum Detour of Rectilinear Paths in the L1 Plane
"... Abstract. The spanning ratio and maximum detour of a graph G embedded in a metric space measure how well G approximates the minimum complete graph containing G and metric space, respectively. In this paper we show that computing the spanning ratio of a rectilinear path P in L1 space has a lower boun ..."
Abstract
 Add to MetaCart
Abstract. The spanning ratio and maximum detour of a graph G embedded in a metric space measure how well G approximates the minimum complete graph containing G and metric space, respectively. In this paper we show that computing the spanning ratio of a rectilinear path P in L1 space has a lower
Finding Rectilinear Paths Among Obstacles In A TwoLayer Interconnection Model
, 1996
"... Finding the best rectilinear path with respect to the bends and the lengths of paths connecting two given points in the presence of rectilinear obstacles in a twolayer model is studied in this paper. In this model, rectilinear obstacles on each layer are specified separately, and the orientation of ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Finding the best rectilinear path with respect to the bends and the lengths of paths connecting two given points in the presence of rectilinear obstacles in a twolayer model is studied in this paper. In this model, rectilinear obstacles on each layer are specified separately, and the orientation
A LineSearch Rectilinear Path Finding Algorithm among Simulated Intelligent Rectilinear Obstacles for a 2D Grid
"... This paper presents a rectilinear path finding algorithm for twodimensional grids, given two distinct points and a set of obstacles. The algorithm finds applications in Computer Aided Design (CAD) of Very Large Scale Integration (VLSI) and robotic navigation in constrained environments ..."
Abstract
 Add to MetaCart
This paper presents a rectilinear path finding algorithm for twodimensional grids, given two distinct points and a set of obstacles. The algorithm finds applications in Computer Aided Design (CAD) of Very Large Scale Integration (VLSI) and robotic navigation in constrained environments
An Efficient Direct Approach for Computing Shortest Rectilinear Paths among Obstacles in a TwoLayer Interconnection Model
, 1998
"... In this paper, we present a direct approach for routing a shortest rectilinear path between two points among a set of rectilinear obstacles in a twolayer interconnection model. The previously best known direct approach for this problem takes O(n log n) time and O(n log n) space. By using integer ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this paper, we present a direct approach for routing a shortest rectilinear path between two points among a set of rectilinear obstacles in a twolayer interconnection model. The previously best known direct approach for this problem takes O(n log n) time and O(n log n) space. By using
AN OPTIMAL DATA STRUCTURE FOR SHORTEST RECTILINEAR PATH QUERIES IN A SIMPLE RECTILINEAR POLYGON
 INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS
, 1993
"... We present a data structure that allows to preprocess a rectilinear polygon with n vertices such that, for any two query points, the shortest path in the rectilinear link or L1metric can be reported in time O(log n + k) where k is the link length of the shortest path. If only the distance is of in ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
We present a data structure that allows to preprocess a rectilinear polygon with n vertices such that, for any two query points, the shortest path in the rectilinear link or L1metric can be reported in time O(log n + k) where k is the link length of the shortest path. If only the distance
Routing Techniques in Wireless Sensor Networks: A Survey
 IEEE Wireless Communications
, 2004
"... Wireless Sensor Networks (WSNs) consist of small nodes with sensing, computation, and wireless communications capabilities. Many routing, power management, and data dissemination protocols have been specifically designed for WSNs where energy awareness is an essential design issue. The focus, howeve ..."
Abstract

Cited by 704 (2 self)
 Add to MetaCart
Wireless Sensor Networks (WSNs) consist of small nodes with sensing, computation, and wireless communications capabilities. Many routing, power management, and data dissemination protocols have been specifically designed for WSNs where energy awareness is an essential design issue. The focus, however, has been given to the routing protocols which might differ depending on the application and network architecture. In this paper, we present a survey of the stateoftheart routing techniques in WSNs. We first outline the design challenges for routing protocols in WSNs followed by a comprehensive survey of different routing techniques. Overall, the routing techniques are classified into three categories based on the underlying network structure: flat, hierarchical, and locationbased routing. Furthermore, these protocols can be classified into multipathbased, querybased, negotiationbased, QoSbased, and coherentbased depending on the protocol operation. We study the design tradeoffs between energy and communication overhead savings in every routing paradigm. We also highlight the advantages and performance issues of each routing technique. The paper concludes with possible future research areas. 1
Results 1  10
of
11,957