Sciweavers

277 search results - page 13 / 56
» New results on shortest paths in three dimensions
Sort
View
AUTOMATICA
2007
88views more  AUTOMATICA 2007»
13 years 7 months ago
Three and higher dimensional autonomous formations: Rigidity, persistence and structural persistence
In this paper, we generalize the notion of persistence, which has been originally introduced for two-dimensional formations, to Rd for d 3, seeking to provide a theoretical framew...
Changbin Yu, Julien M. Hendrickx, Baris Fidan, Bri...
EOR
2007
79views more  EOR 2007»
13 years 7 months ago
The directional p
An instance of a p-median problem gives n demand points. The objective is to locate p supply points in order to minimize the total distance of the demand points to their nearest s...
Laura E. Jackson, George N. Rouskas, Matthias F. M...
COMPGEOM
1995
ACM
13 years 11 months ago
A New Technique for Analyzing Substructures in Arrangements
We present a simple but powerful new probabilistic technique for analyzing the combinatorial complexity of various substructures in arrangements of piecewise-linear surfaces in hig...
Boaz Tagansky
FSTTCS
2004
Springer
14 years 1 months ago
Short-Cuts on Star, Source and Planar Unfoldings
When studying a 3D polyhedron, it is often easier to cut it open and atten in on the plane. There are several ways to perform this unfolding. Standard unfoldings which have been u...
Vijay Chandru, Ramesh Hariharan, Narasimha M. Kris...
ICC
2011
IEEE
217views Communications» more  ICC 2011»
12 years 7 months ago
A Distributed Algorithm for Multi-Constrained Anypath Routing in Wireless Mesh Networks
— Anypath routing, a new routing paradigm, has been proposed to improve the performance of wireless networks by exploiting the spatial diversity and broadcast nature of the wirel...
Xi Fang, Dejun Yang, Guoliang Xue