Compression algorithms -- Happy eliminating -- Three dimension compression

[Mark-haofeng]

Background Research and Understanding:

• Review existing compression algorithms that have been used with 3D data.
• Understand the current 3D compression requirement in the system.

Algorithm Design: Greedy Approach:

• Define criteria for selecting cubes for possible merging.
• Determine how to efficiently read data plane by plane.

Implementation:

• Implement the greedy algorithm to read data plane by plane.
• Implement iteration over each cubic of a plane.
• Implement comparison of a cubic with the previous and next planes to identify potential merges.

Merging Logic:

• Determine and implement the logic for when a merge should occur.
• Implement the logic to push merged results into the output tasks.

Integration:

• Integrate the new compression method with other parts of the system.
• Ensure seamless interaction with existing processes and features.

Time Units Taken 20-30 hrs