(a) Describe and analyze a data structure to store a set H of n horizontal...  Home/Search
Context
Related
| uiuc.edu/~jeffe/teaching/47...hw3sol.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: uiuc.edu/~jeffe/teaching/...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: ach insertion or deletion crates a new version of T y ; we attach each version to the corresponding leaf in T x . The overall preprocessing time is O(n log n), and the overall space is O(n). To answer a query for point (a; b), we search for a in T x to nd the correct version of T y , and then search that version of T y for the successor of b. The query time in each tree is O(log n), so the overall query time is also O(log n). (b) Modify the previous data structure to store a set of n... (Update)
Active bibliography (related documents): More All
0.1: Improved Sparsification - Eppstein, Galil, Italiano (1993) (Correct)
0.1: Ambivalent Data Structures For Dynamic 2-Edge-Connectivity And .. - Frederickson (1991) (Correct)
0.1: Offline Algorithms for Dynamic Minimum Spanning Tree Problems - Eppstein (1994) (Correct)
Similar documents based on text: More All
0.2: Persistent Linked Structures at Constant Worst-Case Cost - Boroujerdi, Moret (Correct)
0.2: Partially Persistent Search Trees with Transcript Operations - Larsen (1999) (Correct)
0.1: Multidimensional Membership Queries for Temporal Databases - Lifei Tan University (Correct)
BibTeX entry: (Update)
@misc{ describe-several,
author = "Describe And Analyze",
title = "Several geometric data structures for objects in the plane can be constructed
using persistent binary search trees. (I know, I promised I wouldn't do
much geometry, but this was sort of irresistible.)",
url = "citeseer.ist.psu.edu/599448.html" }
Citations (may not include all citations):118 Data structures for on-line updating of minimum spanning tre.. (context) - Frederickson - 1985
54 Ambivalent data structures for dynamic 2-edge-connectivity a.. - Frederickson - 1997
7 smallest spanning trees (context) - Eppstein - 1992
Documents on the same site (http://compgeom.cs.uiuc.edu/~jeffe/teaching/473/index.html): More
time rebuilding the tree. So the overall expected time for a - Delete Log Log (Correct)
Kinetic Data Structures - A State of the Art Report - Guibas (1998) (Correct)
Splay Trees - In This Lecture (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC