Data structures for range-aggregate extent queries

DOI10.1016/J.COMGEO.2009.08.001zbMATH Open1302.65054OpenAlexW2124120807MaRDI QIDQ390147FDOQ390147

Authors: Prosenjit Gupta, Ravi Janardan, Yokesh Kumar, Michiel Smid 

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

• Algorithms and Computation
• Range-Aggregate Queries Involving Geometric Aggregation Operations
• Range-aggregate query problems involving geometric aggregation operations
• scientific article; zbMATH DE number 1241835
• Approximate range searching

zbMATH Keywords

computational geometrydata structuresrange searchingdiameterVoronoi diagramswidthclosest pairEuclidean minimum spanning treesmultilevel range trees

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Cited In (27)

• 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?)
• Two-dimensional range diameter queries
• On the power of the semi-separated pair decomposition
• Point set distance and orthogonal range problems with dependent geometric uncertainties
• Aggregate-\textsc{Max} top-\(k\) nearest neighbor searching in the \(L_{1}\) plane
• Range-aggregate query problems involving geometric aggregation operations
• Finding pairwise intersections inside a query range
• Title not available (Why is that?)
• Algorithms and Computation
• Closest-pair queries in fat rectangles
• Range search on tuples of points
• New bounds for range closest-pair problems
• 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
• Approximate range queries for clustering
• Title not available (Why is that?)
• On top-\(k\) weighted sum aggregate nearest and farthest neighbors in the \(L_1\) plane
• On the Power of the Semi-Separated Pair Decomposition
• Data structures for extension violations in a query range
• Opportunistic data structures for range queries
• Approximate range closest-pair queries

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)