Data structures for range-aggregate extent queries

DOI10.1016/J.COMGEO.2009.08.001MaRDI QIDQ390147zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

closest paircomputational geometrydata structuresdiameterEuclidean minimum spanning treesmultilevel range treesrange searchingVoronoi diagramswidth

Mathematics Subject Classification ID

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

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

Cited in

(27)

• Finding pairwise intersections inside a query range
• Applications of range query theory to relational data base join and selection operations
• Efficient external memory structures for range-aggregate queries
• On the power of the semi-separated pair decomposition
• Approximate range closest-pair queries
• Range search on tuples of points
• Closest-pair queries in fat rectangles
• Opportunistic data structures for range queries
• New bounds for range closest-pair problems
• Two-dimensional range diameter queries
• Aggregate-\textsc{Max} top-\(k\) nearest neighbor searching in the \(L_{1}\) plane
• scientific article; zbMATH DE number 2086302 (Why is no real title available?)
• Range-Aggregate Queries Involving Geometric Aggregation Operations
• On the Power of the Semi-Separated Pair Decomposition
• scientific article; zbMATH DE number 1945834 (Why is no real title available?)
• scientific article; zbMATH DE number 2081109 (Why is no real title available?)
• Searching for the closest-pair in a query translate
• Approximate range queries for clustering
• New bounds for range closest-pair problems
• Algorithms and Computation
• On top-\(k\) weighted sum aggregate nearest and farthest neighbors in the \(L_1\) plane
• Point set distance and orthogonal range problems with dependent geometric uncertainties
• scientific article; zbMATH DE number 2226802 (Why is no real title available?)
• Range-aggregate query problems involving geometric aggregation operations
• Algorithms and Computation
• Data structures for extension violations in a query range
• Closest-pair queries and minimum-weight queries are equivalent for squares

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)