# Geometric spanner

A geometric spanner or a t-spanner graph or a t-spanner was initially introduced as a weighted graph over a set of points as its vertices for whichâ€¦Â (More)
Wikipedia

1999-2016

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
• Symposium on Computational Geometry
• 2016
It is easier to understand an algorithm when it can be seen in interactive mode. The current study implemented four algorithms toâ€¦Â (More)
Is this relevant?
2015
2015
• Chris Hoedemakers
• 2015
The topic of this thesis is geometric spanner networks. Geometric spanners are networks defined by a set of points P and a set ofâ€¦Â (More)
Is this relevant?
2008
2008
• Encyclopedia of Algorithms
• 2008
Given a geometric graph in d-dimensional space, it is useful to preprocess it so that distance queries, exact or approximate, canâ€¦Â (More)
Is this relevant?
2008
2008
• ACM Trans. Algorithms
• 2008
Given an arbitrary real constant &epsiv; &gt; 0, and a geometric graph <i>G</i> in <i>d</i>-dimensional Euclidean space with <i>nâ€¦Â (More)
Is this relevant?
2008
2008
• SODA
• 2008
For a set <i>S</i> of points in &#8477;<sup>d</sup>, a t-spanner is a sparse graph on the points of <i>S</i> such that betweenâ€¦Â (More)
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Aimed at an audience of researchers and graduate students in computational geometry and algorithm design, this book uses theâ€¦Â (More)
Is this relevant?
2005
2005
• STACS
• 2005
Let S be a set of points in R. Given a geometric spanner graph, G = (S, E), with constant dilation t, and a positive constantâ€¦Â (More)
Is this relevant?
2005
2005
• Pacific Symposium on Biocomputing
• 2005
We describe the 3-D structure of a protein using geometric spanners--geometric graphs with a sparse set of edges where pathsâ€¦Â (More)
Is this relevant?
Highly Cited
2002
Highly Cited
2002
• ICDCS
• 2002
We propose a new geometric spanner for wireless ad hoc networks, which can be constructed efficiently in a distributed manner. Itâ€¦Â (More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
• MobiHoc
• 2001
We propose a new routing graph, the Restricted Delaunay Graph (RDG), for ad hoc networks. Combined with a node clusteringâ€¦Â (More)
Is this relevant?