A simple and efficient kinetic spanner

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 )

• Type: Conference
• Year: 2008
• Where: COMPGEOM
• Authors: Mohammad Ali Abam, Mark de Berg, Joachim Gudmundsson
• Keywords: 2)-DavenportSchinzel Sequence, COMPGEOM 2008, Discrete Geometry, Kinetic Data Structure, Maximum Length