Sciweavers

279 search results - page 40 / 56
» Implicit Convex Polygons
Sort
View
SI3D
2009
ACM
14 years 2 months ago
Interactive water streams with sphere scan conversion
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 ...
Rama Hoetzlein, Tobias Höllerer
GMP
2010
IEEE
190views Solid Modeling» more  GMP 2010»
14 years 15 days ago
A Subdivision Approach to Planar Semi-algebraic Sets
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...
Angelos Mantzaflaris, Bernard Mourrain
CDC
2008
IEEE
107views Control Systems» more  CDC 2008»
14 years 2 months ago
Locally optimal decomposition for autonomous obstacle avoidance with the Tunnel-MILP algorithm
— 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...
Michael P. Vitus, Steven Lake Waslander, Claire J....
ICRA
2005
IEEE
114views Robotics» more  ICRA 2005»
14 years 1 months ago
Geometric Reformulation of 3-Fingered Force-Closure Condition
— 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...
Attawith Sudsang, Thanathorn Phoka
ACIVS
2005
Springer
14 years 1 months ago
Image Registration Using Uncertainty Transformations
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, ...
Kristof Teelen, Peter Veelaert