Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Segment_tree> ?p ?o. }
Showing items 1 to 27 of
27
with 100 items per page.
- Segment_tree abstract "In computer science, a segment tree is a tree data structure for storing intervals, or segments. It allows querying which of the stored segments contain a given point. It is, in principle, a static structure; that is, its content cannot be modified once the structure is built. A similar data structure is the interval tree.A segment tree for a set I of n intervals uses O(n log n) storage and can be built in O(n log n) time. Segment trees support searching for all the intervals that contain a query point in O(log n + k), k being the number of retrieved intervals or segments.Applications of the segment tree are in the areas of computational geometry, and geographic information systems.The segment tree can be generalized to higher dimension spaces as well.".
- Segment_tree thumbnail Segment_tree_instance.gif?width=300.
- Segment_tree wikiPageExternalLink tutorial6.pdf.
- Segment_tree wikiPageID "13682464".
- Segment_tree wikiPageRevisionID "599037076".
- Segment_tree hasPhotoCollection Segment_tree.
- Segment_tree subject Category:Binary_trees.
- Segment_tree subject Category:Computer_graphics_data_structures.
- Segment_tree subject Category:Trees_(data_structures).
- Segment_tree type Abstraction100002137.
- Segment_tree type Arrangement105726596.
- Segment_tree type Cognition100023271.
- Segment_tree type ComputerGraphicsDataStructures.
- Segment_tree type DataStructure105728493.
- Segment_tree type PsychologicalFeature100023100.
- Segment_tree type Structure105726345.
- Segment_tree comment "In computer science, a segment tree is a tree data structure for storing intervals, or segments. It allows querying which of the stored segments contain a given point. It is, in principle, a static structure; that is, its content cannot be modified once the structure is built. A similar data structure is the interval tree.A segment tree for a set I of n intervals uses O(n log n) storage and can be built in O(n log n) time.".
- Segment_tree label "Segment tree".
- Segment_tree label "Дерево отрезков".
- Segment_tree label "线段树".
- Segment_tree sameAs m.03cd_cz.
- Segment_tree sameAs Q2377385.
- Segment_tree sameAs Q2377385.
- Segment_tree sameAs Segment_tree.
- Segment_tree wasDerivedFrom Segment_tree?oldid=599037076.
- Segment_tree depiction Segment_tree_instance.gif.
- Segment_tree isPrimaryTopicOf Segment_tree.