A new approach to rectangle intersections part I

DOI10.1080/00207168308803364MaRDI QIDQ3659158zbMATH OpenOpenAlexFDO

Authors 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 geometryconcrete complexitydata structurerectilinearly-oriented rectanglesearching

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(19)

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

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

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