Weak 1/r-nets for moving points

Alexandre Rok, Shakhar Smorodinsky

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

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.

Original languageEnglish
Title of host publication32nd International Symposium on Computational Geometry, SoCG 2016
EditorsSandor Fekete, Anna Lubiw
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Pages59.1-59.13
ISBN (Electronic)9783959770095
DOIs
StatePublished - 1 Jun 2016
Event32nd International Symposium on Computational Geometry, SoCG 2016 - Boston, United States
Duration: 14 Jun 201617 Jun 2016

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume51
ISSN (Print)1868-8969

Conference

Conference32nd International Symposium on Computational Geometry, SoCG 2016
Country/TerritoryUnited States
CityBoston
Period14/06/1617/06/16

Keywords

  • Hypergraphs
  • Weak ε-nets

Fingerprint

Dive into the research topics of 'Weak 1/r-nets for moving points'. Together they form a unique fingerprint.

Cite this