Counting and Reporting Intersections of d-Ranges

DOI10.1109/TC.1982.1675973MaRDI QIDQ3933765zbMATH OpenOpenAlexFDO

Authors Hans-Werner Six, D. Wood

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

computational geometrydata structuresrectanglessegment 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)

Cited in

(8)

• Polygonal intersection searching
• A new approach to rectangle intersections part I
• Parallel data distribution management on shared-memory multiprocessors
• Local polyhedra and geometric graphs
• Fast dynamic intersection searching in a set of isothetic line segments
• A new approach to rectangle intersections
• Graph problems arising from parameter identification of discrete dynamical systems
• Divide-and-conquer in planar geometry

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

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