1243 search results - page 114 / 249 » On the locality of bounded growth |
133
click to vote
COMPGEOM
2004
ACM
15 years 12 months ago
2004
ACM
We present an algorithm to compute a Delaunay mesh conforming to a polyhedron possibly with small input angles. The radius-edge ratio of most output tetrahedra are bounded by a co...
172
click to vote
INFOCOM
2003
IEEE
15 years 11 months ago
2003
IEEE
— In this paper, we present a Minimum Spanning Tree (MST) based topology control algorithm, called Local Minimum Spanning Tree (LMST), for wireless multi-hop networks. In this al...
157
click to vote
CIE
2008
Springer
15 years 8 months ago
2008
Springer
A computable graph is computably categorical if any two computable presentations of the graph are computably isomorphic. In this paper we investigate the class of computably catego...
177
click to vote
DCG
2010
15 years 6 months ago
2010
We present a Delaunay refinement algorithm for meshing a piecewise smooth complex in three dimensions. The algorithm protects edges with weighted points to avoid the difficulty po...
216
click to vote
CVPR
2011
IEEE
14 years 10 months ago
2011
IEEE
Two problems occur when bundle adjustment (BA) is applied on long image sequences: the large calculation time and the drift (or error accumulation). In recent work, the calculatio...