Data structures for range-aggregate extent queries
From MaRDI portal
Publication:390147
DOI10.1016/J.COMGEO.2009.08.001zbMATH Open1302.65054OpenAlexW2124120807MaRDI QIDQ390147FDOQ390147
Michiel Smid, Yokesh Kumar, Prosenjit Gupta, Ravi Janardan
Publication date: 22 January 2014
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2009.08.001
Recommendations
computational geometrydata structuresrange searchingdiameterVoronoi diagramswidthclosest pairEuclidean minimum spanning treesmultilevel range trees
Cited In (21)
- Closest-pair queries and minimum-weight queries are equivalent for squares
- Title not available (Why is that?)
- Applications of range query theory to relational data base join and selection operations
- Title not available (Why is that?)
- On the power of the semi-separated pair decomposition
- Approximate Range Queries for Clustering
- Finding pairwise intersections inside a query range
- Title not available (Why is that?)
- Closest-pair queries in fat rectangles
- Searching for the closest-pair in a query translate
- Range-Aggregate Queries Involving Geometric Aggregation Operations
- Efficient external memory structures for range-aggregate queries
- New bounds for range closest-pair problems
- Algorithms and Computation
- Title not available (Why is that?)
- On the Power of the Semi-Separated Pair Decomposition
- New Bounds for Range Closest-Pair Problems
- Data structures for extension violations in a query range
- Opportunistic data structures for range queries
- Approximate range closest-pair queries
- Range closest-pair search in higher dimensions
This page was built for publication: Data structures for range-aggregate extent queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q390147)
