2980 search results - page 407 / 596 » Computational Geometry |
164
click to vote
COMPGEOM
2004
ACM
15 years 12 months ago
2004
ACM
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean sh...
214
click to vote
CAPTECH
1998
Springer
15 years 10 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...
155
click to vote
SIGGRAPH
2010
ACM
15 years 10 months ago
2010
ACM
We introduce a new method for simulating frictional contact between volumetric objects using interpenetration volume constraints. When applied to complex geometries, our formulati...
162
click to vote
EMMCVPR
2009
Springer
15 years 4 months ago
2009
Springer
Determining Euclidean transformations for the robust registration of noisy unstructured point sets is a key problem of model-based computer vision and numerous industrial applicati...
191
click to vote
CVPR
2012
IEEE
13 years 9 months ago
2012
IEEE
In this paper, we propose a general framework for approximating differential operator directly on point clouds and use it for geometric understanding on them. The discrete approxi...