Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Interval_tree> ?p ?o. }
Showing items 1 to 20 of
20
with 100 items per page.
- Interval_tree abstract "In computer science, an interval tree is an ordered 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 Θ(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 are dynamic, i.e., they allow insertion and deletion of intervals. They obtain a query time of O(log n) while the preprocessing time to construct the data structure is O(n log n) (but the space consumption is O(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 interval-tree.
- Interval_tree wikiPageID "1533767".
- Interval_tree wikiPageRevisionID "594816145".
- Interval_tree hasPhotoCollection Interval_tree.
- Interval_tree subject Category:Trees_(data_structures).
- Interval_tree comment "In computer science, an interval tree is an ordered 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 "Drzewo przedziałowe".
- Interval_tree label "Interval tree".
- Interval_tree label "区間木".
- Interval_tree sameAs 区間木.
- Interval_tree sameAs Drzewo_przedziałowe.
- Interval_tree sameAs m.058qc6.
- Interval_tree sameAs Q6057306.
- Interval_tree sameAs Q6057306.
- Interval_tree wasDerivedFrom Interval_tree?oldid=594816145.
- Interval_tree isPrimaryTopicOf Interval_tree.