JOIN
Get Time
forums   
Search | Watch Thread  |  My Post History  |  My Watches  |  User Settings
View: Flat  | Threaded  | Tree
Previous Thread  |  Next Thread
Re: Persistent Set (response to post by indy256) | Reply
Persistent set is sorted set that also can return any of it's previous states in O(log (number of changes))
Suppose you have some polygons on the plane that do not intersect and have total number of vertices n. You want to be able to answer queries about some point in what polygon it lies. You want to answer this queries in O(log n) worst case time and you do not know all this queries beforehead (e. g. next point will be generated using results of previous calculations)
Subject Author Date
Persistent Set Egor Apr 26, 2011 at 4:31 AM EDT
Re: Persistent Set indy256 Apr 27, 2011 at 4:55 AM EDT
Re: Persistent Set Egor Apr 27, 2011 at 5:25 AM EDT
Re: Persistent Set indy256 Apr 27, 2011 at 8:11 AM EDT
Re: Persistent Set Egor Apr 27, 2011 at 10:23 AM EDT
Re: Persistent Set Egor Apr 27, 2011 at 10:47 AM EDT
Re: Persistent Set pmachado Apr 27, 2011 at 10:59 AM EDT
Re: Persistent Set Egor Apr 27, 2011 at 1:31 PM EDT
Re: Persistent Set pmachado Apr 29, 2011 at 11:32 PM EDT
Re: Persistent Set mukel May 4, 2011 at 12:33 AM EDT
Re: Persistent Set joney_000 Feb 7, 2017 at 4:41 PM EST
RSS