Deterministic rectangle enclosure and offline dominance reporting on the RAM

DOI10.1007/978-3-662-43948-7_7MaRDI QIDQ5167732zbMATH OpenOpenAlexFDO

Authors Peyman Afshani, Timothy M. Chan, 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

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Analysis of algorithms (68W40)

Recommendations

• The Rectangle Enclosure and Point-Dominance Problems Revisited
• Fast algorithms for direct enclosures and direct dominances
• Computing rectangle enclosures
• Optimal deterministic shallow cuttings for 3-d dominance ranges
• Orthogonal range searching on the RAM, revisited

Cited in

(6)

• Optimal deterministic shallow cuttings for 3-d dominance ranges
• Orthogonal range searching in moderate dimensions: k-d trees and range trees strike back
• The Rectangle Enclosure and Point-Dominance Problems Revisited
• Approximating the k-Level in Three-Dimensional Plane Arrangements
• Lower envelopes of surface patches in 3-space
• 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

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