Finding pairwise intersections of rectangles in a query rectangle

DOI10.4230/LIPICS.ISAAC.2017.60MaRDI QIDQ5136281zbMATH OpenFDO

Authors Eunjin Oh, Hee-Kap Ahn

Publication date 25 November 2020

Full work available at URL https://arxiv.org/abs/1801.07362

zbMATH Keywords

geometric data structuresintersectionaxis-parallel rectangles

Mathematics Subject Classification ID

Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Finding pairwise intersections of rectangles in a query rectangle
• Finding pairwise intersections inside a query range
• Finding pairwise intersections inside a query range
• Computing rectangle enclosures
• Dynamic rectangular intersection with priorities

Cites work

• scientific article; zbMATH DE number 1241835 (Why is no real title available?)
• scientific article; zbMATH DE number 910894 (Why is no real title available?)
• Algorithms and Computation
• Computational geometry. Algorithms and applications.
• Filtering Search: A New Approach to Query-Answering
• Finding pairwise intersections inside a query range
• Lower bounds for orthogonal range searching: I. The reporting case
• Making data structures persistent
• Orthogonal Range Reporting in Three and Higher Dimensions
• Range-Aggregate Queries Involving Geometric Aggregation Operations

Cited in

(3)

• Finding pairwise intersections inside a query range
• Finding pairwise intersections of rectangles in a query rectangle
• Finding pairwise intersections inside a query range

This page was built for publication: Finding pairwise intersections of rectangles in a query rectangle

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5136281)