|
Algorithm Development Kit 1.0 |
||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.Objectalgs.model.problems.EnclosingIntervalSearch
public class EnclosingIntervalSearch
Given a set S of n intervals and a query point q, report all of those intervals that contain q. That is, find a subset F of S such that:
F = {I_n | I_n.left <= q <= I_n.right }
| Method Summary | |
|---|---|
static java.util.Set<IInterval> |
compute(SegmentTree<StoredIntervalsNode> tree,
int q)
Return the computed set. |
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Method Detail |
|---|
public static java.util.Set<IInterval> compute(SegmentTree<StoredIntervalsNode> tree,
int q)
tree - Segment tree containing the intervals to be searchedq - the target point to be used to check intersection with intervals stored by the tree.
IInterval segments that intersect point q.
|
Algorithm Development Kit 1.0 | ||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||