Abstract
In this paper we develop some new data structures for storing a set of disks that can answer different types of intersection queries efficiency. If the disks are non-intersecting we obtain a linear size data structure that can report allk disks intersecting a query line segment in timeO(n β+e +k), wheren is the number of disks,β=log2(1+√5)−1 ≈ 0.695, and e is an arbitrarily small positive constant. If the segment is a full line, the query time becomesO(n β +k). For intersecting disks we obtain anO(n logn) size data structure that can answer an intersection query in timeO(n 2/3 log2 n+k). We also present a linear size data structure for ray shooting queries, whose query time isO(n β ).
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
