1539 search results - page 78 / 308 » Fast and Simple Methods For Computing Control Points |
161
Voted
CAPTECH
1998
Springer
15 years 6 months ago
1998
Springer
Abstract. This paper presents a new technique for computing collisionfree navigation motions from task-level commands for animated human characters in interactive virtual environme...
113
Voted
AAAI
1998
15 years 3 months ago
1998
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...
112
click to vote
GD
2005
Springer
15 years 8 months ago
2005
Springer
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
97
Voted
ICPR
2006
IEEE
16 years 3 months ago
2006
IEEE
This paper addresses the problem of tracking a 3D plane over a sequence of images acquired by a free moving camera, a task that is of central importance to a wide variety of visio...
155
click to vote
CVPR
2009
IEEE
16 years 9 months ago
2009
IEEE
We present a fast graph cut algorithm for planar graphs.
It is based on the graph theoretical work [2] and leads to an
efficient method that we apply on shape matching and im-
a...