A simple and efficient kinetic spanner

13 years 6 months ago

Download www.gudmundsson.biz

We present a kinetic data structure for maintaining a (1+ )-spanner of size O(n/2 ) for a set of n moving points in the plane. Assuming the trajectories of the points can be described by polynomials whose degrees are at most s, the number of events processed by our structure is O((n/2 )

Mohammad Ali Abam, Mark de Berg, Joachim Gudmundss

Real-time Traffic

2)-DavenportSchinzel Sequence | COMPGEOM 2008 | Discrete Geometry | Kinetic Data Structure | Maximum Length |

claim paper

» qPIPSA Relating enzymatic kinetic parameters and interaction fields

» Bayesian inference for a discretely observed stochastic kinetic model

» Kinetic KDtrees and longestside KDtrees

» Lifetime Maximization in Wireless Sensor Networks by Distributed Binary Search

» A quasipassive model of human leg function in levelground walking

» Circadian system modeling and phase control

» New timescale criteria for model simplification of bioreaction systems

Post Info
More Details (n/a)

Added	18 Oct 2010
Updated	18 Oct 2010
Type	Conference
Year	2008
Where	COMPGEOM
Authors	Mohammad Ali Abam, Mark de Berg, Joachim Gudmundsson

Comments (0)

Sciweavers

A simple and efficient kinetic spanner

2)-DavenportSchinzel Sequence | COMPGEOM 2008 | Discrete Geometry | Kinetic Data Structure | Maximum Length |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers