License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.SoCG.2017.55
URN: urn:nbn:de:0030-drops-72354
URL: http://drops.dagstuhl.de/opus/volltexte/2017/7235/
Go to the corresponding LIPIcs Volume Portal


Rahul, Saladi

Approximate Range Counting Revisited

pdf-format:
LIPIcs-SoCG-2017-55.pdf (0.6 MB)


Abstract

We study range-searching for colored objects, where one has to count (approximately) the number of colors present in a query range. The problems studied mostly involve orthogonal range-searching in two and three dimensions, and the dual setting of rectangle stabbing by points. We present optimal and near-optimal solutions for these problems. Most of the results are obtained via reductions to the approximate uncolored version, and improved data-structures for them. An additional contribution of this work is the introduction of nested shallow cuttings.

BibTeX - Entry

@InProceedings{rahul:LIPIcs:2017:7235,
  author =	{Saladi Rahul},
  title =	{{Approximate Range Counting Revisited}},
  booktitle =	{33rd International Symposium on Computational Geometry (SoCG 2017)},
  pages =	{55:1--55:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-038-5},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{77},
  editor =	{Boris Aronov and Matthew J. Katz},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/7235},
  URN =		{urn:nbn:de:0030-drops-72354},
  doi =		{10.4230/LIPIcs.SoCG.2017.55},
  annote =	{Keywords: orthogonal range searching, rectangle stabbing, colors, approximate count, geometric data structures}
}

Keywords: orthogonal range searching, rectangle stabbing, colors, approximate count, geometric data structures
Seminar: 33rd International Symposium on Computational Geometry (SoCG 2017)
Issue Date: 2017
Date of publication: 08.06.2017


DROPS-Home | Fulltext Search | Imprint Published by LZI