A new approach to rectangle intersections part I
DOI10.1080/00207168308803364zbMATH Open0513.68058OpenAlexW2068587771MaRDI QIDQ3659158FDOQ3659158
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
Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Searching and sorting (68P10) Discrete mathematics in relation to computer science (68R99)
Cites Work
Cited In (18)
- Quasi-Linear-Time Algorithm for Longest Common Circular Factor
- Optimal external memory planar point enclosure
- A UNIFIED APPROACH TO AUTOMATIC LABEL PLACEMENT
- An (Almost) Optimal Solution for Orthogonal Point Enclosure Query in ℝ3
- Title not available (Why is that?)
- Ranking intervals under visibility constraints∗
- Efficient splitting and merging algorithms for order decomposable problems.
- Using topological sweep to extract the boundaries of regions in maps represented by region quadtrees
- Local polyhedra and geometric graphs
- SMB: Collision detection based on temporal coherence
- Approximate colored range and point enclosure queries
- Fast dynamic intersection searching in a set of isothetic line segments
- Algorithms for the multiple label placement problem
- Computing the depth distribution of a set of boxes
- Divide-and-conquer in planar geometry
- Graph problems arising from parameter identification of discrete dynamical systems
- I/O-efficient dynamic planar point location
- External memory planar point location with logarithmic updates
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)
