ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Approximate range counting revisited

Rahul, S (2021) Approximate range counting revisited. In: Journal of Computational Geometry, 12 (1). pp. 40-69.

JoCG_12-1_40-69_2021.pdf - Published Version

Download (718kB) | Preview
Official URL: https://doi.org/10.20382/JOCG.V12I1A3


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. © 2021, Carleton University. All rights reserved.

Item Type: Journal Article
Publication: Journal of Computational Geometry
Publisher: Carleton University
Additional Information: The copyright for this article belongs to the Author
Department/Centre: Division of Electrical Sciences > Computer Science & Automation
Date Deposited: 18 Aug 2021 07:47
Last Modified: 18 Aug 2021 07:47
URI: http://eprints.iisc.ac.in/id/eprint/69023

Actions (login required)

View Item View Item