Deterministic Rectangle Enclosure and Offline Dominance Reporting on the RAM
From MaRDI portal
Publication:5167732
DOI10.1007/978-3-662-43948-7_7zbMath1410.68360OpenAlexW84449724MaRDI QIDQ5167732
Timothy M. Chan, Peyman Afshani, Konstantinos Tsakalidis
Publication date: 1 July 2014
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-43948-7_7
Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (4)
Orthogonal range searching in moderate dimensions: k-d trees and range trees strike back ⋮ Approximating the k-Level in Three-Dimensional Plane Arrangements ⋮ Optimal deterministic shallow cuttings for 3-d dominance ranges ⋮ Optimal deterministic algorithms for 2-d and 3-d shallow cuttings
This page was built for publication: Deterministic Rectangle Enclosure and Offline Dominance Reporting on the RAM