279 search results - page 32 / 56 » Implicit Convex Polygons |
ICRA
2010
IEEE
13 years 6 months ago
2010
IEEE
— Contact dynamics are commonly formulated as a linear complementarity problem. While this approach is superior to earlier spring-damper models, it can be inaccurate due to pyram...
IWPEC
2004
Springer
14 years 1 months ago
2004
Springer
We propose to look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, poi...
CGF
2008
13 years 7 months ago
2008
Barycentric coordinates can be used to express any point inside a triangle as a unique convex combination of the triangle's vertices, and they provide a convenient way to lin...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
Treemaps are a popular technique to visualize hierarchical data. The input is a weighted tree T where the weight of each node is the sum of the weights of its children. A treemap ...
AUTOMATICA
2006
13 years 7 months ago
2006
In some of the recently-developed algorithms for convex parametric quadratic programs it is implicitly assumed that the intersection of the closures of two adjacent critical regio...