A new approach to rectangle intersections part I

DOI10.1080/00207168308803364zbMath0513.68058OpenAlexW2068587771MaRDI QIDQ3659158

Herbert Edelsbrunner

Publication date: 1983

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168308803364

zbMATH Keywords

computational geometrysearchingdata structureconcrete complexityrectilinearly-oriented rectangle

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Data structures (68P05) Information storage and retrieval of data (68P20) Discrete mathematics in relation to computer science (68R99)

Related Items (18)

I/O-efficient dynamic planar point location ⋮ Optimal external memory planar point enclosure ⋮ SMB: Collision detection based on temporal coherence ⋮ A UNIFIED APPROACH TO AUTOMATIC LABEL PLACEMENT ⋮ Using topological sweep to extract the boundaries of regions in maps represented by region quadtrees ⋮ Ranking intervals under visibility constraints^∗ ⋮ An (Almost) Optimal Solution for Orthogonal Point Enclosure Query in ℝ³ ⋮ Algorithms for the multiple label placement problem ⋮ Graph problems arising from parameter identification of discrete dynamical systems ⋮ Unnamed Item ⋮ Divide-and-conquer in planar geometry ⋮ Local polyhedra and geometric graphs ⋮ Computing the depth distribution of a set of boxes ⋮ Approximate colored range and point enclosure queries ⋮ External memory planar point location with logarithmic updates ⋮ Quasi-Linear-Time Algorithm for Longest Common Circular Factor ⋮ Efficient splitting and merging algorithms for order decomposable problems. ⋮ Fast dynamic intersection searching in a set of isothetic line segments

Cites Work

• A Lower Bound on the Complexity of Orthogonal Range Queries
• Counting and Reporting Intersections of d-Ranges

This page was built for publication: A new approach to rectangle intersections part I