277 search results - page 4 / 56 » New results on shortest paths in three dimensions |
PAMI
2010
13 years 6 months ago
2010
—Shortest paths have been used to segment object boundaries with both continuous and discrete image models. Although these techniques are well defined in 2D, the character of the...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
We observe that the classical maximum flow problem in any directed planar graph G can be reformulated as a parametric shortest path problem in the oriented dual graph G . This ref...
BIRTHDAY
2009
Springer
14 years 2 months ago
2009
Springer
In this paper, we consider a number of results and six conjectures on properly coloured (PC) paths and cycles in edge-coloured multigraphs. We overview some known results and prov...
ICRA
2006
IEEE
14 years 1 months ago
2006
IEEE
— This paper presents a new Path Planning method which operates in two steps. In the first step the safest areas in the environment are extracted by means of a Voronoi diagram. ...
BROADNETS
2007
IEEE
14 years 2 months ago
2007
IEEE
— Network dimensioning for wavelength-routed WDM networks has been extensively studied to maximize connection acceptance rate while minimizing the total cost. However, Internet s...