Finding pairwise intersections inside a query range
From MaRDI portal
Publication:1755743
DOI10.1007/s00453-017-0384-3zbMath1410.68367arXiv1502.06079OpenAlexW2167808398WikidataQ59521732 ScholiaQ59521732MaRDI QIDQ1755743
Joachim Gudmundsson, Ali D. Mehrabi, Mark T. de Berg
Publication date: 11 January 2019
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1502.06079
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)
Related Items
Finding pairwise intersections of rectangles in a query rectangle ⋮ An (Almost) Optimal Solution for Orthogonal Point Enclosure Query in ℝ3
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Data structures for range-aggregate extent queries
- Data structures for extension violations in a query range
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
- Applications of random sampling in computational geometry. II
- On a class of \(O(n^ 2)\) problems in computational geometry
- On the power of the semi-separated pair decomposition
- Two-Dimensional Range Diameter Queries
- Range-Aggregate Queries Involving Geometric Aggregation Operations
- Some methods of computational geometry applied to computer graphics
- Optimal Point Location in a Monotone Subdivision
- Filtering Search: A New Approach to Query-Answering
- A Functional Approach to Data Structures and Its Use in Multidimensional Searching
- Orthogonal Range Reporting in Three and Higher Dimensions
- Improved Bounds for Orthogonal Point Enclosure Query and Point Location in Orthogonal Subdivisions in ℝ3
- Orthogonal range reporting
- Improved Bounds for the Union of Locally Fat Objects in the Plane
