Bin (computational geometry)
In computational geometry, the bin is a data structure which allows efficient region queries. Each time a data point falls into a bin, the frequency of that bin is increased by one. For example, if there are some axis-aligned rectangles on a 2D plane, answers the question: "Given a query rectangle, what are the rectangles intersecting it?". In the example in the figure, A, B, C, D, E and F are existing rectangles, the query with the rectangle Q should return C, D, E and F, if we define all rectangles as closed intervals.
Wikipage disambiguates
primaryTopic
Bin (computational geometry)
In computational geometry, the bin is a data structure which allows efficient region queries. Each time a data point falls into a bin, the frequency of that bin is increased by one. For example, if there are some axis-aligned rectangles on a 2D plane, answers the question: "Given a query rectangle, what are the rectangles intersecting it?". In the example in the figure, A, B, C, D, E and F are existing rectangles, the query with the rectangle Q should return C, D, E and F, if we define all rectangles as closed intervals.
has abstract
In computational geometry, the ...... rresponding bin's linked list.
@en
Wikipage page ID
13,764,454
Wikipage revision ID
726,175,660
subject
hypernym
type
comment
In computational geometry, the ...... ectangles as closed intervals.
@en
label
Bin (computational geometry)
@en
