Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Interval_tree> ?p ?o }
Showing triples 1 to 59 of
59
with 100 triples per page.
- Interval_tree abstract "In computer science, an interval tree is a tree data structure to hold intervals. Specifically, it allows one to efficiently find all intervals that overlap with any given interval or point. It is often used for windowing queries, for instance, to find all roads on a computerized map inside a rectangular viewport, or to find all visible elements inside a three-dimensional scene. A similar data structure is the segment tree.The trivial solution is to visit each interval and test whether it intersects the given point or interval, which requires O(n) time, where n is the number of intervals in the collection. Since a query may return all intervals, for example if the query is a large interval intersecting all intervals in the collection, this is asymptotically optimal; however, we can do better by considering output-sensitive algorithms, where the runtime is expressed in terms of m, the number of intervals produced by the query. Interval trees have a query time of O(log n + m) and an initial creation time of O(n log n), while limiting memory consumption to O(n). After creation, interval trees may be dynamic, allowing efficient insertion and deletion of an interval in O(log n). If the endpoints of intervals are within a small integer range (e.g., in the range [1,...,O(n)]), faster data structures exist with preprocessing time O(n) and query time O(1+m) for reporting m intervals containing a given query point.".
- Interval_tree wikiPageExternalLink intervaltree.
- Interval_tree wikiPageExternalLink 978-3-642-10631-6_18.
- Interval_tree wikiPageExternalLink www.cgal.org.
- Interval_tree wikiPageExternalLink intervaltree.
- Interval_tree wikiPageExternalLink interval-tree.
- Interval_tree wikiPageID "1533767".
- Interval_tree wikiPageLength "21852".
- Interval_tree wikiPageOutDegree "24".
- Interval_tree wikiPageRevisionID "680158993".
- Interval_tree wikiPageWikiLink Asymptotically_optimal.
- Interval_tree wikiPageWikiLink Asymptotically_optimal_algorithm.
- Interval_tree wikiPageWikiLink Binary_heap.
- Interval_tree wikiPageWikiLink Binary_search_tree.
- Interval_tree wikiPageWikiLink Category:Search_trees.
- Interval_tree wikiPageWikiLink Computer_science.
- Interval_tree wikiPageWikiLink File:Check_if_a_point_overlaps_the_intervals_in_S_center_of_a_centered_interval_tree.svg.
- Interval_tree wikiPageWikiLink File:Example_of_augmented_tree_with_low_value_as_the_key_and_maximum_high_as_extra_annotation.png.
- Interval_tree wikiPageWikiLink Franco_P._Preparata.
- Interval_tree wikiPageWikiLink Interval_(mathematics).
- Interval_tree wikiPageWikiLink Introduction_to_Algorithms.
- Interval_tree wikiPageWikiLink Jens_M._Schmidt.
- Interval_tree wikiPageWikiLink Marc_van_Kreveld.
- Interval_tree wikiPageWikiLink Mark_Overmars.
- Interval_tree wikiPageWikiLink Mark_de_Berg.
- Interval_tree wikiPageWikiLink Michael_Ian_Shamos.
- Interval_tree wikiPageWikiLink Otfried_Schwarzkopf.
- Interval_tree wikiPageWikiLink Output-sensitive_algorithm.
- Interval_tree wikiPageWikiLink Range_tree.
- Interval_tree wikiPageWikiLink Segment_tree.
- Interval_tree wikiPageWikiLink Self-balancing_binary_search_tree.
- Interval_tree wikiPageWikiLink Tree_(data_structure).
- Interval_tree wikiPageWikiLink Tree_rotation.
- Interval_tree wikiPageWikiLink File:Binary_search_tree_delete.svg.
- Interval_tree wikiPageWikiLinkText "Interval tree".
- Interval_tree wikiPageWikiLinkText "interval tree".
- Interval_tree hasPhotoCollection Interval_tree.
- Interval_tree wikiPageUsesTemplate Template:CS-Trees.
- Interval_tree wikiPageUsesTemplate Template:Citation.
- Interval_tree wikiPageUsesTemplate Template:Citation_needed.
- Interval_tree wikiPageUsesTemplate Template:Harvtxt.
- Interval_tree wikiPageUsesTemplate Template:Paragraph_break.
- Interval_tree subject Category:Search_trees.
- Interval_tree hypernym Structure.
- Interval_tree type Building.
- Interval_tree type Structure.
- Interval_tree type Technique.
- Interval_tree comment "In computer science, an interval tree is a tree data structure to hold intervals. Specifically, it allows one to efficiently find all intervals that overlap with any given interval or point. It is often used for windowing queries, for instance, to find all roads on a computerized map inside a rectangular viewport, or to find all visible elements inside a three-dimensional scene.".
- Interval_tree label "Interval tree".
- Interval_tree sameAs Árbol_de_intervalo.
- Interval_tree sameAs درخت_بازه.
- Interval_tree sameAs 区間木.
- Interval_tree sameAs Drzewo_przedziałowe.
- Interval_tree sameAs m.058qc6.
- Interval_tree sameAs Интервал_стабла.
- Interval_tree sameAs Q6057306.
- Interval_tree sameAs Q6057306.
- Interval_tree wasDerivedFrom Interval_tree?oldid=680158993.
- Interval_tree isPrimaryTopicOf Interval_tree.