# Kinetic stable Delaunay graphs

Published

Journal Article

The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in ℝ2 is (nearly) cubic, even if each point is moving with a fixed velocity. We introduce the notion of a stable Delaunay graph (SDG in short), a dynamic subgraph of the Delaunay triangulation, that is less volatile in the sense that it undergoes fewer topological changes and yet retains many useful properties of the full Delaunay triangulation. SDG is defined in terms of a parameter α > 0, and consists of Delaunay edges pq for which the (equal) angles at which p and q see the corresponding Voronoi edge epq are at least α. We prove several interesting properties of SDG and describe two kinetic data structures for maintaining it. Both structures use O*(n) storage. They process O* (n2) events during the motion, each in O*(1) time, provided that the points of P move along algebraic trajectories of bounded degree; the O*(·) notation hides multiplicative factors that are polynomial in 1/α and polylogarithmic in n. The first structure is simpler but the dependency on 1/α in its performance is higher.

### Full Text

### Duke Authors

### Cited Authors

- Agarwal, PK; Gao, J; Guibas, LJ; Kaplan, H; Koltun, V; Rubin, N; Sharir, M

### Published Date

- July 30, 2010

### Published In

- Proceedings of the Annual Symposium on Computational Geometry

### Start / End Page

- 127 - 136

### Digital Object Identifier (DOI)

- 10.1145/1810959.1810984

### Citation Source

- Scopus