On kinetic delaunay triangulations: A near quadratic bound for unit speed motions

Natan Rubin

doi:https://doi.org/10.1109/FOCS.2013.62

On kinetic delaunay triangulations: A near quadratic bound for unit speed motions

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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	https://doi.org/10.1109/FOCS.2013.62
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

All Science Journal Classification (ASJC) codes

Computer Science(all)

Access to Document

https://doi.org/10.1109/FOCS.2013.62

Cite this

@inproceedings{b2579f264da44e0ebfe97bb8a8726d4b,

title = "On kinetic delaunay triangulations: A near quadratic bound for unit speed motions",

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.",

keywords = "Combinatorial complexity, Delaunay triangulation, Discrete changes, Moving points, Voronoi diagram",

author = "Natan Rubin",

year = "2013",

month = dec,

day = "1",

doi = "https://doi.org/10.1109/FOCS.2013.62",

language = "English",

isbn = "9780769551357",

pages = "519--528",

booktitle = "Proceedings - 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, FOCS 2013",

note = "2013 IEEE 54th Annual Symposium on Foundations of Computer Science, FOCS 2013 ; Conference date: 27-10-2013 Through 29-10-2013",

}

Rubin, N 2013, On kinetic delaunay triangulations: A near quadratic bound for unit speed motions. in Proceedings - 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, FOCS 2013., 6686188, pp. 519-528, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, FOCS 2013, Berkeley, CA, United States, 27/10/13. https://doi.org/10.1109/FOCS.2013.62

TY - GEN

T1 - On kinetic delaunay triangulations

T2 - 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, FOCS 2013

AU - Rubin, Natan

PY - 2013/12/1

Y1 - 2013/12/1

N2 - 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.

AB - 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.

KW - Combinatorial complexity

KW - Delaunay triangulation

KW - Discrete changes

KW - Moving points

KW - Voronoi diagram

UR - http://www.scopus.com/inward/record.url?scp=84893446521&partnerID=8YFLogxK

U2 - https://doi.org/10.1109/FOCS.2013.62

DO - https://doi.org/10.1109/FOCS.2013.62

M3 - Conference contribution

SN - 9780769551357

SP - 519

EP - 528

BT - Proceedings - 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, FOCS 2013

Y2 - 27 October 2013 through 29 October 2013

ER -

On kinetic delaunay triangulations: A near quadratic bound for unit speed motions

Abstract

Conference

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this