Intersection queries in sets of disks

DOI10.1007/3-540-52846-6_107zbMath1502.68349OpenAlexW1495191348MaRDI QIDQ5056120

Mark H. Overmars, Pankaj K. Agarwal, Marc J. van Kreveld

Publication date: 9 December 2022

Published in: SWAT 90 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-52846-6_107

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)

Related Items (1)

On intersection searching problems involving curved objects

Cites Work

• Unnamed Item
• Visibility and intersection problems in plane geometry
• Storing line segments in partition trees
• On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
• \(\epsilon\)-nets and simplex range queries
• Halfplanar range search in linear space and \(O(n^{0.695})\) query time
• Fractional cascading. I: A data structuring technique
• Quasi-optimal range searching in spaces of finite VC-dimension
• Optimal Point Location in a Monotone Subdivision
• Searching and storing similar lists
• Space searching for intersecting objects

This page was built for publication: Intersection queries in sets of disks