970 search results - page 123 / 194 » On encodings of spanning trees |
190
click to vote
CAD
2007
Springer
15 years 6 months ago
2007
Springer
The reconstruction of a surface model from a point cloud is an important task in the reverse engineering of industrial parts. We aim at constructing a curve network on the point c...
137
click to vote
JCT
2007
15 years 6 months ago
2007
Abstract. We consider lattice walks in the plane starting at the origin, remaining in the first quadrant i, j ≥ 0 and made of West, South and North-East steps. In 1965, Germain ...
150
click to vote
JDA
2007
15 years 6 months ago
2007
In this paper, we review a recently developed class of algorithms that solve global problems in unit distance wireless networks by means of local algorithms. A local algorithm is ...
148
click to vote
TROB
2008
15 years 6 months ago
2008
Abstract--This paper addresses the challenging problem of finding collision-free trajectories for many robots moving toward individual goals within a common environment. Most popul...
165
click to vote
ALGORITHMICA
2002
15 years 6 months ago
2002
Let S be a set of n points in a metric space, and k a positive integer. Algorithms are given that construct k-fault-tolerant spanners for S. If in such a spanner at most k vertice...