CSCI 1200 Data Structures- Quad Trees and Tree Iteration

Students Who Viewed This Also Studied

CSCI 1200 Data Structures

Task

 Quad Trees & Tree Iteration

In this assignment you will build a custom data structure named QuadTree. The data structure you will build for this homework is similar to the classic quad tree, octree, &-d tree, and binary space partition data structures from computational geometry. These structures are used to improve the performance of applications that use large spatial data sets including: ray tracing in computer graphics. collision detection for simulation and gaming, motion planning for robotics, nearest neighbor calculation. image processing, and many, many others. Our QuadTree implementation will share some of the framework of the de_set implementation we have seen in lecture and lab. You are encouraged to carefully study that implementation as you work on this homework.

Like an STL map and STL set. inserting a new Point into the QuadTree or querying (using find} whether a Point is already in the structure is fast. and can be completed in O(log n}. where n is the number of Points in the tree. However. unlike the set and map structures which are based on a binary tree, having two subtrees per node, the QuadTree has 4 children at each node!

Here is a diagram showing the relationships between the different classes you will implement for this assignment. Be sure to draw plenty of your own diagrams as you work, and be prepared to show these diagrams when you come to office hours or ALAC tutoring to ask for help on the assignment.

Note that the QuadTree is ternplated over two types, the number_type and the labeliype. In this example. the number type is int and the label type is char. This is the detailed internal memary representation after adding the first 3 points in the example on the previous page. We also show a sample DepthIterator object initially attached to the root node of this tree. You should follow this diagram exactly. using these specific class and member variable types and names and placeholder template type names. We do not present the details of the BreadthIterator class in this diagram. You may design the internal representation of that class to complete the specified functionality.

Implementation

Your task for this homework is to implement the structure diagrammed above. We recommend that you begin your implementation by following the structure of the de_set class we studied in lecture and lab. You will need to make a number of significant changes to the code. but the overall design: a “manager” class (QuadTree), the Hode class, and tree_iterator classes is similar. We provide the Point class and the implementation of the two QuadTree member functions for printing: plot and print_sideways. You will build the rest of your implementation around this starter code. Remember that because this is a templated class, you will not separate the implementation into .b and .cpp files. Keep all of your implementation in a single file named quad_tree.h, but make sure it is well-organized and appropriately commented.

The provided code in main.cpp illustrates the basic functionality of the QuadTree class including the QuadTree functions: size. insert. find. height, begin, end, bf_begin, and bf_end, and iterator functions: operator++ (both pre- and post- increment), operator* (dereference), getLabel, and getDepth. Study these examples carefully to deduce the expected argument and return types of the functions. As this is a class with dynamically-allocated memory, you will also need to implement, test. and debug the copy

constructor, assignment operator, and destructor. Submitty will compile and run quad tree with the instructor’s solution to test your implementation of these functions. It will test your code with Dr. Memory and your program must be memory error and memory leak free for full credit.

We encourage you to work through the test cases in the provided main. cpp step-by-step, uncommenting and debugging one test at a time. The provided test cases do not adequately test all corner cases, so as you work, add your own test cases to the student_tests function. Be sure to test your templated implementation with other number types (e.g., float, double) and other label /data types (e.g.. STL string. int, etc.). Note that the ASCII art plot function is intended only for debugging use on modest-sized examples with small non-negative integers and char labels. Furthermore. the plot function assumes that no two points have the same x coordinate or the same y coordinate.

CSCI 1200 Data Structures

Business Management

Learning objectives as covered up to week 9, with an emphasis on topics of weeks 6 through 9.  On successful completion of this assignment you should have demonstrated that you are able to:  ï‚· Write a program consisting of multiple objects which interact with each other …

View Answer

Business Management

Along with your code, you will need to provide a report which includes the following sections:1. Game design – How did you come up with a solution to meet the brief? 1. What did you need to do to work out how to get the horses to stop/turn at the relevant points on the track? 2. How did you design t …

View Answer

CIS 493 Big Data Processing

Task:
One of the most common machine generated Big data format is JSON format. Create a database for the given Yelp Business data by converting the data in a Semi-Structured JSON format to a structured file format (CSV, TSV) so that the converted files can be directly created as database tables in …

View Answer

PROG24310 Programming Languages

Task:
Problem N1 You have the following context-free gramma:S -> ABB -> bAaAB | aA -> Ab |Using the grammar above and a right-most derivation, is it possible to obtain a string “babbabbabba” ?If so, please provide the derivation process and build the abstract syntax tree. Is this grammar ambi …

View Answer