An optimal synchronizer for the hypercube
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
There are planar graphs almost as good as the complete graph
Journal of Computer and System Sciences
Classes of graphs which approximate the complete Euclidean graph
Discrete & Computational Geometry
Davenport-Schinzel sequences and their geometric applications
Davenport-Schinzel sequences and their geometric applications
Near-quadratic bounds for the L1 Voronoi diagram of moving points
Computational Geometry: Theory and Applications - Special issue: computational geometry, theory and applications
Kinetic data structures: a state of the art report
WAFR '98 Proceedings of the third workshop on the algorithmic foundations of robotics on Robotics : the algorithmic perspective: the algorithmic perspective
Voronoi diagrams based on convex distance functions
SCG '85 Proceedings of the first annual symposium on Computational geometry
Static and kinetic geometric spanners with applications
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Fast Greedy Algorithms for Constructing Sparse Geometric Spanners
SIAM Journal on Computing
Fault-Tolerant Geometric Spanners
Discrete & Computational Geometry
Deformable spanners and applications
Computational Geometry: Theory and Applications
Geometric Spanner Networks
Region-fault tolerant geometric spanners
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Kinetic Euclidean minimum spanning tree in the plane
Journal of Discrete Algorithms
Kinetic pie delaunay graph and its applications
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Kinetic data structures for all nearest neighbors and closest pair in the plane
Proceedings of the twenty-ninth annual symposium on Computational geometry
Proceedings of the twenty-ninth annual symposium on Computational geometry
| Hi-index | 0.00 |
We present a new and simple (1+@e)-spanner of size O(n/@e^2) for a set of n points in the plane, which can be maintained efficiently as the points move. Assuming the trajectories of the points can be described by polynomials whose degrees are at most s, the number of topological changes to the spanner is O((n/@e^2)@?@l"s"+"2(n)), and at each event the spanner can be updated in O(1) time.