algorithm - Finding the closest intervals in an interval tree that do not contain the query -


i have implemented interval tree in java outlined in clrs algorithm book (it uses red-black tree underlying structure). in book (and far i've seen online), discusses how find node interval contains number being queried.

in case, if number being queried not fall interval, want know 'closest' nodes are, i.e., intervals lie before , after query. have accomplished using following functions. each node contains interval (int low, int high), min , max values of , subtrees. 

public node[] findprevnext(int query) {     if (tree.root.isnull())         return null;     else {         node prev = findprev(query, tree.root, new node());         node next = findnext(query, tree.root, new node());         node[] result = {prev, next};         return result;     } }  private node findprev(int query, node x, node prev) {     if (x.interval.high < query && x.interval.high > prev.interval.high)         prev = x;     if (!x.left.isnull())         prev = findprev(query, x.left, prev);     if (!x.right.isnull())         prev = findprev(query, x.right, prev);     return prev; }  private node findnext(int query, node x, node next) {     if (x.interval.low > query && x.interval.low < next.interval.low)         next = x;     if (!x.left.isnull())         next = findnext(query, x.left, next);     if (!x.right.isnull())         next = findnext(query, x.right, next);     return next; }

the problem, of course, functions findprev() , findnext() both traverse whole tree , don't take advantage of tree's structure. there way perform query in o(lgn) time?

i've considered possibility of creating second interval tree contain interval gaps, , doing query on there. nodes contain information elements before , after gap (i have attempted of yet unsuccessful in implementing this).

edit: note, function findprevnext() called after attempting find query fails. so, query known not fall in given interval beforehand.

the java treemap, implements red-black tree, implements methods headmap , tailmap return portions of map less query point (for headmap) or greater query point (for tailmap). if implement similar these methods tree should allow linear traversal query point find n closest intervals, rather having traverse entire tree.


Comments

Post a Comment

Popular posts from this blog

jquery - How can I dynamically add a browser tab? -

since using iframes house external pages are, accounts "not preferred method" , disallowed sites (flickr, one), want dynamically generate browser tabs. e.g., when user submits form, want dynamically generate tab on browser in response submitted. e.g., might want add new tab url like: http://www.bigsurgarrapata.com/contact how in jquery? you want form target attribute action attribute. http://www.w3schools.com/tags/att_form_target.asp browsers have ultimate control on result of target attribute open new tab value of _blank. <form action="contact_submit.php" target="_blank" method="post">
Read more

node.js - Getting the socket id,user id pair of a logged in user(s) -

i have web application done using node js , in it,i have authentication system requires users log in before can access pages. have 2 pages,the homepage , updates page. from read docs,a new socket id issued when user opens tab in browser. me being admin,i know socket id of logged in user , more so,the socket id,logged in user id pair logged in users. what method can use socket id,logged in user id pair make sure broadcast realtime info users online?.
Read more

keyboard - C++ GetAsyncKeyState alternative -

i using windows.h library's getasynckeystate function define key pushed on keyboard . here program returns int value of pushed key example. #include <iostream> #include <windows.h> using namespace std; int main (){ char i; for(i=8;i<190;i++){ if(getasynckeystate(i)== -32767){ cout<<int (i)<<endl; } } return 0; } but trying make opengl simple game , function appeared slow . there function not need cycle 180 times , if statement . thanks you're trying make opengl game, you're going use glfw. if that's case can away using glfwgetkey() such: if (glfwgetkey(glfw_key_up) == glfw_press) {...} if (glfwgetkey(glfw_key_down) == glfw_press) {...} that method nicely explained in tutorial 6 opengl-tutorial.org . should start first tutorial of beginners tutorials , later intermediate tutorials . if you're going make win32 window can listen wm_keydown or wm_keyup messages , virtua
Read more