Abstract
Let P be a collection of n points in the plane, each moving along some straight line at unit speed. We obtain an almost tight upper bound of O(n 2+ε), for any ε > 0, on the maximum number of discrete changes that the Delaunay triangulation DT(P) of P experiences during this motion. Our analysis is cast in a purely topological setting, where we only assume that (i) any four points can be co-circular at most three times, and (ii) no triple of points can be collinear more than twice; these assumptions hold for unit speed motions.
| Original language | English |
|---|---|
| Title of host publication | Proceedings - 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, FOCS 2013 |
| Pages | 519-528 |
| Number of pages | 10 |
| DOIs | |
| State | Published - 1 Dec 2013 |
| Externally published | Yes |
| Event | 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, FOCS 2013 - Berkeley, CA, United States Duration: 27 Oct 2013 → 29 Oct 2013 |
Conference
| Conference | 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, FOCS 2013 |
|---|---|
| Country/Territory | United States |
| City | Berkeley, CA |
| Period | 27/10/13 → 29/10/13 |
Keywords
- Combinatorial complexity
- Delaunay triangulation
- Discrete changes
- Moving points
- Voronoi diagram
ASJC Scopus subject areas
- Computer Science (all)