Sciweavers

50 search results - page 2 / 10
» Spanners for Geometric Intersection Graphs
Sort
View
CORR
2008
Springer
133views Education» more  CORR 2008»
13 years 5 months ago
On Geometric Spanners of Euclidean and Unit Disk Graphs
We consider the problem of constructing bounded-degree planar geometric spanners of Euclidean and unit-disk graphs. It is well known that the Delaunay subgraph is a planar geometri...
Iyad A. Kanj, Ljubomir Perkovic
FOCS
1994
IEEE
13 years 8 months ago
Randomized and deterministic algorithms for geometric spanners of small diameter
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
SIAMCOMP
2010
76views more  SIAMCOMP 2010»
13 years 3 months ago
On Spanners and Lightweight Spanners of Geometric Graphs
Iyad A. Kanj, Ljubomir Perkovic, Ge Xia
SODA
2001
ACM
126views Algorithms» more  SODA 2001»
13 years 6 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
ESA
2009
Springer
127views Algorithms» more  ESA 2009»
13 years 9 months ago
Geometric Spanners for Weighted Point Sets
Let (S, d) be a finite metric space, where each element p ∈ S has a non-negative weight w(p). We study spanners for the set S with respect to weighted distance function dw, wher...
Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, ...