@inproceedings{2083ea1903ac43e2948ea69ca4950eaa,
title = "Weak 1/r-nets for moving points",
abstract = "In this paper, we extend the weak 1/r-net theorem to a kinetic setting where the underlying set of points is moving polynomially with bounded description complexity. We establish that one can find a kinetic analog N of a weak 1/r-net of cardinality O(rd(d+1)/2 logd r) whose points are moving with coordinates that are rational functions with bounded description complexity. Moreover, each member of N has one polynomial coordinate.",
keywords = "Hypergraphs, Weak ε-nets",
author = "Alexandre Rok and Shakhar Smorodinsky",
note = "Publisher Copyright: {\textcopyright} Alexandre Rok and Shakhar Smorodinsky.; 32nd International Symposium on Computational Geometry, SoCG 2016 ; Conference date: 14-06-2016 Through 17-06-2016",
year = "2016",
month = jun,
day = "1",
doi = "10.4230/LIPIcs.SoCG.2016.59",
language = "English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
pages = "59.1--59.13",
editor = "Sandor Fekete and Anna Lubiw",
booktitle = "32nd International Symposium on Computational Geometry, SoCG 2016",
address = "Germany",
}