jtoumey / immerse Goto Github PK

There is too much detail exposed to the main function. Passing and updating pointers should be handled by the objects.

• Create a method that immerses the polygon and refines the mesh automatically. This can make use of existing methods.
  • Break up the functionality into reading the polygon, refining based on point locations, traversing the tree if the node has already been allocated, etc.

Currently, the refine method recursively refines the entire tree by adding four children to each parent until reaching the max_level. This duplicates the functionality of the insert method, which does the same but only for one level at the current node memory address.

Instead, refine should accept a level of refinements to perform (1 or more) and do that instead.

It would be useful to traverse the quadtree and optionally write the cell center and other information to a file for visualization. This can work in a recursive manner (similar to refinement), but only proceed if the cell initialization != NULL.

• Modify the code such that a leaf cell (cell with no children) has some indicator (e.g., NULL value of some flag).

Use a more appropriate data structure for storing the polygon.

• https://w3.cs.jmu.edu/bowersjc/page/courses/spring17/cs480/labs/dcel/
• http://www.flipcode.com/archives/The_Half-Edge_Data_Structure.shtml
• https://cs184.eecs.berkeley.edu/article/12
• http://www.cs.sfu.ca/~binay/813.2011/DCEL.pdf
• https://cs.stackexchange.com/questions/2450/how-do-i-construct-a-doubly-connected-edge-list-given-a-set-of-line-segments

1. Traverse to the finest level of the tree (determined when is_leaf == true). Store the memory address of the path (e.g., the memory address of the current node).
2. Move up one level (may require storage of memory address of parent node).
3. Use the memory address saved in 1. to deallocate the object associated with the refined node and set the child pointer to NULL.
4. Repeat in the desired manner (until an appropriate level is attained, etc.).