Counting and Reporting Intersections of d-Ranges

DOI10.1109/TC.1982.1675973zbMath0477.68072OpenAlexW1985480430MaRDI QIDQ3933765

Derick Wood, Hans-Werner Six

Publication date: 1982

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.1982.1675973

zbMATH Keywords

data structurescomputational geometryrectanglessegment treebounding boxesrange tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Discrete mathematics in relation to computer science (68R99)

Related Items (7)

Graph problems arising from parameter identification of discrete dynamical systems ⋮ Polygonal intersection searching ⋮ Divide-and-conquer in planar geometry ⋮ Local polyhedra and geometric graphs ⋮ A new approach to rectangle intersections part I ⋮ A new approach to rectangle intersections ⋮ Fast dynamic intersection searching in a set of isothetic line segments

This page was built for publication: Counting and Reporting Intersections of d-Ranges