Building the High-Performance LOD Plotter

Explain why rendering millions of data points directly is inefficient.

Design the data structure for a min-max tree to store aggregated data.

Implement a bottom-up algorithm to build the min-max tree from an array of data points.

Implement a function to query the min-max range for an arbitrary interval in logarithmic time.

Calculate the visible data range based on the current zoom and pan state.

Implement a decimation algorithm to select representative points based on screen resolution.

Render the plot using the min-max tree, drawing single vertical bars when data density exceeds pixel density.

Implement culling logic to avoid rendering data that is outside the visible screen area.