D. Eppstein / Berlin / Wellesley / Amsterdam / Snowbird / Davenport / Bern / New York / /
Company
Cambridge University Press / CRC Press Inc. / /
Country
United States / Netherlands / /
Currency
pence / USD / /
Facility
PRELIMINARIES Stable / Tel Aviv University / Guibas Stanford University Natan Rubin Tel Aviv University Micha Sharir Tel Aviv University / University Jie Gao SUNY Stony Brook Vladlen Koltun Stanford University Leonidas J / University ABSTRACT The / stable Delaunay / /
IndustryTerm
by-product / straightforward kinetic algorithm / worst-case processing time / secondary balanced binary search tree / search trees / balanced binary search tree / machinery / overall processing time / /
Organization
Duke University / Cambridge University / National Institute of Health / New York University / National Science Foundation / Israel Science Foundation / Stanford University / Israel Binational Science Foundation / Tel Aviv University / SUNY / Israel Science Fund / MINERVA Center for Geometry / /
Person
Natan Rubin / Micha Sharir / Pankaj K. Agarwal / Leo Guibas / Jie Gao / Leonidas J. Guibas / Georges Voronoi / Haim Kaplan / Proc / H. Kaplan / V / /
Kinetic Stable Delaunay Graphs Pankaj K. Agarwal Duke University Haim Kaplan