1. Interval treeIn 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.
Read “Interval tree” on English Wikipedia
Read “区間木” on Japanese Wikipedia
Read “Interval tree” on DBpedia
Read “Interval tree” on English Wikipedia
Read “区間木” on Japanese Wikipedia
Read “Interval tree” on DBpedia
Discussions
Log in to talk about this word.