Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Bin_(computational_geometry)> ?p ?o. }
Showing items 1 to 22 of
22
with 100 items per page.
- Bin_(computational_geometry) abstract "In computational geometry, the bin data structure allows efficient region queries, i.e., if there are some axis-aligned rectangles on a 2D plane, answer the question Given a query rectangle, return all rectangles intersecting it. kd-tree is another data structure that can answer this question efficiently. 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.The data structure partitions a region of the 2D plane into uniform-sized bins. The bounding box of the bins encloses all candidate rectangles to be queried. All the bins are arranged in a 2D array. All the candidates are represented also as 2D arrays. The size of a candidate's array is the number of bins it intersects. For example, in the figure, candidate B has 6 elements arranged in a 3 row by 2 column array because it intersects 6 bins in such an arrangement. Each bin contains the head of a singly linked list. If a candidate intersects a bin, it is chained to the bin's linked list. Each element in a candidate's array is a link node in the corresponding bin's linked list.".
- Bin_(computational_geometry) thumbnail Bin_computational_geometry.png?width=300.
- Bin_(computational_geometry) wikiPageID "13764454".
- Bin_(computational_geometry) wikiPageRevisionID "570714207".
- Bin_(computational_geometry) hasPhotoCollection Bin_(computational_geometry).
- Bin_(computational_geometry) subject Category:Geometric_data_structures.
- Bin_(computational_geometry) type Abstraction100002137.
- Bin_(computational_geometry) type Arrangement105726596.
- Bin_(computational_geometry) type Cognition100023271.
- Bin_(computational_geometry) type DataStructure105728493.
- Bin_(computational_geometry) type GeometricDataStructures.
- Bin_(computational_geometry) type PsychologicalFeature100023100.
- Bin_(computational_geometry) type Structure105726345.
- Bin_(computational_geometry) comment "In computational geometry, the bin data structure allows efficient region queries, i.e., if there are some axis-aligned rectangles on a 2D plane, answer the question Given a query rectangle, return all rectangles intersecting it. kd-tree is another data structure that can answer this question efficiently.".
- Bin_(computational_geometry) label "Bin (computational geometry)".
- Bin_(computational_geometry) sameAs m.03chkn9.
- Bin_(computational_geometry) sameAs Q4913766.
- Bin_(computational_geometry) sameAs Q4913766.
- Bin_(computational_geometry) sameAs Bin_(computational_geometry).
- Bin_(computational_geometry) wasDerivedFrom Bin_(computational_geometry)?oldid=570714207.
- Bin_(computational_geometry) depiction Bin_computational_geometry.png.
- Bin_(computational_geometry) isPrimaryTopicOf Bin_(computational_geometry).
