A new approach to rectangle intersections

DOI10.1080/00207168308803365MaRDI QIDQ3659159zbMATH 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/00207168308803365

zbMATH Keywords

computational geometrydata structuresearchingconcrete complexityrectilinearly-oriented rectangle

Mathematics Subject Classification ID

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

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

Cited in

(10)

• A practical divide-and-conquer algorithm for the rectangle intersection problem
• Internal and external algorithms for the point-in-regions problem - the INSIDE join of georelational algebra
• A UNIFIED APPROACH TO AUTOMATIC LABEL PLACEMENT
• Computing on a free tree via complexity-preserving mappings
• scientific article; zbMATH DE number 7760488 (Why is no real title available?)
• Parallel data distribution management on shared-memory multiprocessors
• Scanline algorithms on a grid
• A space-optimal solution of general region location
• Algorithms for the multiple label placement problem
• Reporting intersections among thick objects.

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

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