Sciweavers

450 search results - page 25 / 90
» Quadrangulations of Planar Sets
Sort
View
CORR
2007
Springer
117views Education» more  CORR 2007»
13 years 9 months ago
Definition sets for the Direct Kinematics of Parallel Manipulators
The aim of this paper is to characterize the uniqueness domains in the workspace of parallel manipulators, as well as their image in the joint space. The notion of aspect introduc...
Philippe Wenger, Damien Chablat
CVPR
2005
IEEE
14 years 11 months ago
Classification of Contour Shapes Using Class Segment Sets
Both example-based and model-based approaches for classifying contour shapes can encounter difficulties when dealing with classes that have large nonlinear variability, especially...
Kang B. Sun, Boaz J. Super
SODA
2010
ACM
176views Algorithms» more  SODA 2010»
14 years 6 months ago
Self-improving Algorithms for Convex Hulls
We describe an algorithm for computing planar convex hulls in the self-improving model: given a sequence I1, I2, . . . of planar n-point sets, the upper convex hull conv(I) of eac...
Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri
ISAAC
2004
Springer
125views Algorithms» more  ISAAC 2004»
14 years 2 months ago
Polyline Fitting of Planar Points Under Min-sum Criteria
Fitting a curve of a certain type to a given set of points in the plane is a basic problem in statistics and has numerous applications. We consider fitting a polyline with k join...
Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehl...
ICRA
2002
IEEE
123views Robotics» more  ICRA 2002»
14 years 2 months ago
Computing Wrench Cones for Planar Contact Tasks
The successful execution of any contact task fundamentally requires the application of wrenches (forces and moments) consistent with the task. We develop an algorithm for computin...
Devin J. Balkcom, Jeffrey C. Trinkle, E. J. Gottli...