Space searching for intersecting objects

DOI10.1016/0196-6774(87)90015-0MaRDI QIDQ5903625zbMATH OpenOpenAlexFDO

Authors David P. Dobkin, Herbert Edelsbrunner

Publication date 1987

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(87)90015-0

zbMATH Keywords

geometric complexitysublinear query timespace-efficient data structures

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Recommendations

• Space searching for intersecting objects
• GENERALIZED INTERSECTION SEARCHING PROBLEMS
• Efficient dynamic algorithms for some geometric intersection problems
• Publication:4934236
• On intersection searching problems involving curved objects

Cited in

(16)

• Space searching for intersecting objects
• scientific article; zbMATH DE number 1389816 (Why is no real title available?)
• Connected component and simple polygon intersection searching
• Line intersection searching amid unit balls in 3-space
• Range searching with efficient hierarchical cuttings
• Diameter partitioning
• On intersection searching problems involving curved objects
• Applications of a new space-partitioning technique
• On range searching with semialgebraic sets
• Intersection queries for flat semi-algebraic objects in three dimensions and related problems
• scientific article; zbMATH DE number 3864520 (Why is no real title available?)
• Intersection queries in sets of disks
• Simplex Range Searching and Its Variants: A Review
• Fractional cascading. II: Applications
• Edge-skeletons in arrangements with applications
• Analysis of a bounding box heuristic for object intersection

This page was built for publication: Space searching for intersecting objects

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