553 search results - page 2 / 111 » On Planar Path Transformation |
SODA
2010
ACM
14 years 4 months ago
2010
ACM
EJC
2008
13 years 7 months ago
2008
We provide bounds for the product of the lengths of distinguished shortest paths in a finite network induced by a triangulation of a topological planar quadrilateral.
FOCS
2005
IEEE
14 years 29 days ago
2005
IEEE
In joint work with ´Eva Tardos in 1995, we asked whether it was possible to obtain a polynomial-time, polylogarithmic approximation algorithm for the disjoint paths problem in th...
ICRA
2002
IEEE
14 years 8 days ago
2002
IEEE
In this article, we will develop parallel processing of one-sided Radon transform for the detection of the position and the orientation of a planar motion object. Detection of pla...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Reachability and distance computation are known to be NL-complete in general graphs, but within UL co-UL if the graphs are planar. However, finding longest paths is known to be N...