120 search results - page 1 / 24 » Triangulation and Embedding Using Small Sets of Beacons |
FOCS
2004
IEEE
13 years 8 months ago
2004
IEEE
Concurrent with recent theoretical interest in the problem of metric embedding, a growing body of research in the networking community has studied the distance matrix defined by n...
MOBIHOC
2000
ACM
13 years 9 months ago
2000
ACM
ln the future, wireless networking will be embedded into a wide variety of common, everyday objects [1]. In many embedded networking situations, the communicating nodes will be ver...
COMGEO
2006
ACM
13 years 4 months ago
2006
ACM
We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to prove an upper bound on the number of Steiner points nee...
JAL
2006
13 years 4 months ago
2006
We present a new algorithm, called LB-Triang, which computes minimal triangulations. We give both a straightforward O(nm0) time implementation and a more involved O(nm) time imple...
IJFCS
2002
13 years 4 months ago
2002
We propose a new data structure to compute the Delaunay triangulation of a set of points in the plane. It combines good worst case complexity, fast behavior on real data, small me...