450 search results - page 80 / 90 » Quadrangulations of Planar Sets |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Let G = (V, E) be a graph. Let c : V → N be a vertex-coloring of the vertices of G. For any vertex u, we denote by N[u] its closed neighborhood (u and its adjacent vertices), an...
ICRA
2010
IEEE
13 years 7 months ago
2010
IEEE
Abstract— Humanoid robots are appealing due to their inherent dexterity. However, these potential benefits may only be realized if the corresponding motion synthesis procedure i...
SIAMCOMP
2010
13 years 7 months ago
2010
Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...
ECCV
2010
Springer
13 years 7 months ago
2010
Springer
Given a set of points corresponding to a 2D projection of a non-planar shape, we would like to obtain a representation invariant to articulations (under no self-occlusions). It is ...
SIAMSC
2011
13 years 4 months ago
2011
Abstract. Radial basis function (RBF) approximation is an extremely powerful tool for representing smooth functions in non-trivial geometries, since the method is meshfree and can ...