In: Computer Science
Suppose you want to store line segments in an R-tree. If a line segment is not parallel to the axes, the bounding box for it can be large, containing a large empty area.
Describe the effect on performance of having large
bounding boxes on queries that ask for line segments intersecting a
given region.
Briefly describe a technique to improve performance
for such queries and give an example of its benefit. Hint: You can
divide segments into smaller pieces.
Explanation:-
If you have any dought about this answer dont give dislike
,tell us your dought in the comment then i can explain, Please rate
me by giving me a like or thumb because it motivates me to do more
work,Thank you.