Finding pairwise intersections of rectangles in a query rectangle

DOI10.4230/LIPICS.ISAAC.2017.60zbMATH Open1457.68294arXiv1801.07362MaRDI QIDQ5136281FDOQ5136281

Authors: Eunjin Oh, Hee-Kap Ahn 

Publication date: 25 November 2020

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

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

zbMATH Keywords

geometric data structuresintersectionaxis-parallel rectangles

Mathematics Subject Classification ID

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

Cites Work

• Filtering Search: A New Approach to Query-Answering
• Computational geometry. Algorithms and applications.
• Making data structures persistent
• Title not available (Why is that?)
• Lower bounds for orthogonal range searching: I. The reporting case
• Algorithms and Computation
• Title not available (Why is that?)
• Range-Aggregate Queries Involving Geometric Aggregation Operations
• Orthogonal Range Reporting in Three and Higher Dimensions
• 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)