Sciweavers

127 search results - page 9 / 26
» The Directed Planar Reachability Problem
Sort
View
SODA
2010
ACM
205views Algorithms» more  SODA 2010»
14 years 7 months ago
Maximum Flows and Parametric Shortest Paths in Planar Graphs
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...
Jeff Erickson
CCCG
2009
13 years 11 months ago
On Directed Graphs with an Upward Straight-line
In this paper we study the problem of computing an upward straight-line embedding of a directed graph G into a point set S, i.e. a planar drawing of G such that each vertex is map...
Carla Binucci, Emilio Di Giacomo, Walter Didimo, A...
ACCV
2006
Springer
14 years 3 months ago
How to Compute the Pose of an Object Without a Direct View?
We consider the task of computing the pose of an object relative to a camera, for the case where the camera has no direct view of the object. This problem was encountered in work o...
Peter F. Sturm, Thomas Bonfort
TCAD
2002
128views more  TCAD 2002»
13 years 9 months ago
Preferred direction Steiner trees
Interconnect optimization for VLSI circuits has received wide attention. To model routing surfaces, multiple circuit layers are freabstracted as a single rectilinear plane, ignori...
Mehmet Can Yildiz, Patrick H. Madden
CORR
2007
Springer
117views Education» more  CORR 2007»
13 years 9 months ago
Definition sets for the Direct Kinematics of Parallel Manipulators
The aim of this paper is to characterize the uniqueness domains in the workspace of parallel manipulators, as well as their image in the joint space. The notion of aspect introduc...
Philippe Wenger, Damien Chablat