Fast Greedy Algorithms for Constructing Sparse Geometric Spanners
From MaRDI portal
Publication:3149878
DOI10.1137/S0097539700382947zbMath1041.68108MaRDI QIDQ3149878
Giri Narasimhan, Joachim Gudmundsson, Christos Levcopoulos
Publication date: 29 September 2002
Published in: SIAM Journal on Computing (Search for Journal in Brave)
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
65D18: Numerical aspects of computer graphics, image analysis, and computational geometry
Related Items
EFFICIENT CONSTRUCTION OF LOW WEIGHTED BOUNDED DEGREE PLANAR SPANNER, A GEOMETRIC SPANNER OF SEGMENTS, Geometric Spanner of Segments, A simple and efficient kinetic spanner, On plane geometric spanners: a survey and open problems, On the stretch factor of Delaunay triangulations of points in convex position, On dynamic shortest paths problems, Stable roommates spanner, Improved local algorithms for spanner construction, Constructing minimum-interference networks, Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies, Computing the greedy spanner in near-quadratic time, On certain geometric properties of the Yao-Yao graphs, Geometric Spanner of Objects under L 1 Distance, The Minimal Manhattan Network Problem in Three Dimensions, The Weak Gap Property in Metric Spaces of Bounded Doubling Dimension
