学堂在线清华大学计算几何(2021春)课后作业题答案
- How many times of queryPST will be called when applying 2D-GRQ using t 2021-05-26
- If we organize each node's children according to their median points, 2021-05-26
- What is wrong about building a minimum heap base on the points on the 2021-05-26
- Which one of the following indicates a general minimum heap? 下列哪一 2021-05-26
- How many times of queryHeap() will be called when searching all keys n 2021-05-26
- Which of the sorted lists need to be scanned for query qx in the foll 2021-05-26
- For the following interval tree, which sorted list should be filled in 2021-05-26
- For the figure below, what are the sizes of Sleft, Smid and Sright? ( 2021-05-26
- For the figure below, what are the numbers of type A and type B segmen 2021-05-26
- We know the storage of BBST is O(nlogn) for 2D range search. What is t 2021-05-26
- We know the query time is O(r+log2n) using BBST for 2D range search. W 2021-05-26
- What is the total space complexity of x-tree and y-trees? 对于上述x-tr 2021-05-26
- Which is correct about the query time complexity of 2d-tree, 3d-tree a 2021-05-26
- If we use the kd-tree below to do a 2D range query, how many times of 2021-05-26
- For the kd-tree below, which one is the correct organization of this t 2021-05-26
- If we apply the BBST below to query (5, 18], which nodes will be repor 2021-05-26
- What is the time complexity of querying in 1D range query? 1D Range Qu 2021-05-26
- What is the path of querying for red point with black circle using sea 2021-05-26
- For the figure below, what are the query results for 1, 2, 3, 4 using 2021-05-26
- As the figure below shows, how will the black point with red circle be 2021-05-26
- If we apply Kirkpatrick's preprocessing to the subdivision below, what 2021-05-26
- Which of the BBSTs need O(1) rotation for updates ? 下列哪种BBST在更新 2021-05-26
- After path copying, What is the space complexity of all these BBSTs? 2021-05-26
- Which data structures are ephemeral structures? (Multiple choice) 下列 2021-05-26
- As the video mentioned, why it takes O(nlogn) to locate a point but O( 2021-05-26