Sciweavers

732 search results - page 18 / 147
» Testing Geometric Convexity
Sort
View
CAD
2000
Springer
13 years 7 months ago
Time-critical multiresolution rendering of large complex models
Very large and geometrically complex scenes, exceeding millions of polygons and hundreds of objects, arise naturally in many areas of interactive computer graphics. Time-critical ...
Enrico Gobbetti, Eric Bouvier
NIPS
2001
13 years 9 months ago
K-Local Hyperplane and Convex Distance Nearest Neighbor Algorithms
Guided by an initial idea of building a complex (non linear) decision surface with maximal local margin in input space, we give a possible geometrical intuition as to why K-Neares...
Pascal Vincent, Yoshua Bengio
ICRA
2008
IEEE
170views Robotics» more  ICRA 2008»
14 years 2 months ago
Fast grasp planning for hand/arm systems based on convex model
— This paper discusses the grasp planning of a multifingered hand attached at the tip of a robotic arm. By using the convex models and the new approximation method of the fricti...
Kensuke Harada, Kenji Kaneko, Fumio Kanehiro
WAE
2001
223views Algorithms» more  WAE 2001»
13 years 9 months ago
An Adaptable and Extensible Geometry Kernel
Geometric algorithms are based on geometric objects such as points, lines and circles. The term Kernel refers to a collection of representations for constant-size geometric objects...
Susan Hert, Michael Hoffmann, Lutz Kettner, Sylvai...
ICPR
2008
IEEE
14 years 9 months ago
Solving quadratically constrained geometrical problems using lagrangian duality
In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...
Carl Olsson, Anders Eriksson