Sciweavers

52 search results - page 3 / 11
» Geometric Spanners for Weighted Point Sets
Sort
View
SODA
2001
ACM
126views Algorithms» more  SODA 2001»
13 years 7 months ago
Static and kinetic geometric spanners with applications
It is well known that the Delaunay Triangulation is a spanner graph of its vertices. In this paper we show that any bounded aspect ratio triangulation in two and three dimensions ...
Menelaos I. Karavelas, Leonidas J. Guibas
WADS
2007
Springer
180views Algorithms» more  WADS 2007»
13 years 12 months ago
Spanners for Geometric Intersection Graphs
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
Martin Fürer, Shiva Prasad Kasiviswanathan
CATS
2006
13 years 7 months ago
Geometric spanners with few edges and degree five
An O(n log n)
Michiel H. M. Smid
COMGEO
1999
ACM
13 years 5 months ago
Dynamic algorithms for geometric spanners of small diameter: Randomized solutions
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
Sunil Arya, David M. Mount, Michiel H. M. Smid
ESA
1994
Springer
138views Algorithms» more  ESA 1994»
13 years 10 months ago
Efficient Construction of a Bounded Degree Spanner with Low Weight
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a graph having the points of S as its vertices such that for any pair p, q of points ther...
Sunil Arya, Michiel H. M. Smid