279 search results - page 40 / 56 » Implicit Convex Polygons |
164
click to vote
SI3D
2009
ACM
15 years 10 months ago
2009
ACM
Fluid simulations require efficient dynamics, surface extraction and rendering in order to achieve real time interaction. We present a novel technique for the surface extraction ...
146
Voted
GMP
2010
IEEE
15 years 8 months ago
2010
IEEE
Abstract. Semi-algebraic sets occur naturally when dealing with implicit models and boolean operations between them. In this work we present an algorithm to efficiently and in a ce...
137
Voted
CDC
2008
IEEE
15 years 10 months ago
2008
IEEE
— The Tunnel-MILP algorithm is a three stage path planning method for 2-D environments that relies on the identification of a sequence of convex polygons to form an obstacle fre...
114
Voted
ICRA
2005
IEEE
15 years 9 months ago
2005
IEEE
— This paper addresses the problem of testing whether three contact points form a 3-fingered force-closure grasp in two dimensions. In particular, assuming frictional point cont...
129
Voted
ACIVS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. In this work we introduce a new technique for a frequently encountered problem in computer vision: image registration. The registration is computed by matching features, ...