450 search results - page 37 / 90 » Quadrangulations of Planar Sets |
114
click to vote
WDAG
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
HUC
1999
Springer
15 years 4 months ago
1999
Springer
BUILD-IT is a planning tool based on computer vision technology, supporting complex planning and composition tasks. A group of people, seated around a table, interact with objects ...
ISAAC
2005
Springer
15 years 5 months ago
2005
Springer
Given a set S of n points in RD , and an integer k such that 0 k < n, we show that a geometric graph with vertex set S, at most n − 1 + k edges, maximum degree five, and dila...
121
click to vote
CVPR
2007
IEEE
16 years 1 months ago
2007
IEEE
We present a new approach to reconstruct the shape of a 3D object or scene from a set of calibrated images. The central idea of our method is to combine the topological flexibilit...
114
click to vote
COMGEO
2012
ACM
13 years 7 months ago
2012
ACM
A straight-line drawing of a plane graph G is a planar drawing of G, where each vertex is drawn as a point and each edge is drawn as a straight line segment. Given a set S of n poi...