Bin (computational geometry)
id:
bin-computational-geometry-241-17298265
title:
Bin (computational geometry)
text:
In computational geometry, the bin is a data structure that 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, the structure can answer the question, "Given a query rectangle, what are the rectangles intersecting it?" In the example in the top figure, A, B, C, D, E and F are existing rectangles, so the query with the rectangle Q should return C, D, E and F,
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Bin_(computational_geometry)
date created:
date modified:
2022-03-11T09:11:27Z
main entity:
{"identifier":"Q4913766","url":"https://www.wikidata.org/entity/Q4913766"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/2/20/Bin_computational_geometry.png","width":816,"height":1056}
fields total:
13
integrity:
14