1594 search results - page 184 / 319 » An Algorithm to Compute Collusion Paths |
121
Voted
TVCG
2008
15 years 3 months ago
2008
We present an interactive algorithm to compute sound propagation paths for transmission, specular reflection and edge diffraction in complex scenes. Our formulation uses an adaptiv...
115
click to vote
JEA
2010
14 years 10 months ago
2010
An upward drawing of a DAG G is a drawing of G in which all edges are drawn as curves increasing monotonically in the vertical direction. In this paper, we present a new approach f...
156
Voted
ICCV
2011
IEEE
14 years 3 months ago
2011
IEEE
In this paper, we show that tracking multiple people whose paths may intersect can be formulated as a convex global optimization problem. Our proposed framework is designed to exp...
132
click to vote
WEA
2010
Springer
15 years 10 months ago
2010
Springer
We successfully contract timetable networks with realistic transfer times. Contraction gradually removes nodes from the graph and adds shortcuts to preserve shortest paths. This r...
119
Voted
ICRA
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract—We present a motion planning algorithm that computes rough trajectories used by a contact-points planner as a guide to grow its search graph. We adapt collision-free mot...