Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

16

STACS
2005
Springer

favoriteEmaildiscussreport

91views Theoretical Computer Science» more STACS 2005»

Fast Pruning of Geometric Spanners

14 years 4 months ago

Fast Pruning of Geometric Spanners

Download www.win.tue.nl

Joachim Gudmundsson, Giri Narasimhan, Michiel H. M

Real-time Traffic

STACS 2005 | Theoretical Computer Science |

claim paper

Related Content

» Spanners for Geometric Intersection Graphs

» Fast Greedy Algorithms for Constructing Sparse Geometric Spanners

» Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs

» Recognizing interspersed sketches quickly

» Electors Voting for Fast Automatic Shape Correspondence

» Voronoi diagram computations for planar NURBS curves

Post Info
More Details (n/a)

Added	28 Jun 2010
Updated	28 Jun 2010
Type	Conference
Year	2005
Where	STACS
Authors	Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid

Comments (0)