3D surface machining basics in CNC Programming - Time & Space Complexity

Time Complexity: 3D surface machining basics

O(n²)

Understanding Time Complexity

When machining 3D surfaces, the time it takes depends on how many points the machine must move through.

We want to know how the machining time grows as the surface detail increases.

Scenario Under Consideration

Analyze the time complexity of the following CNC code snippet.

G90 G94 G17

; Loop over X and Y grid points
FOR I = 0 TO NX-1
  FOR J = 0 TO NY-1
    ; Calculate Z height for surface
    Z = SurfaceHeight(X0 + I*DX, Y0 + J*DY)
    ; Move tool to point
    G01 X{X0 + I*DX} Y{Y0 + J*DY} Z{Z} FFeedRate
  ENDFOR
ENDFOR

This code moves the tool over a grid of points on the surface, adjusting Z to match the 3D shape.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Nested loops over X and Y points to move the tool.
• How many times: The inner move command runs NX x NY times, once per grid point.

How Execution Grows With Input

As the grid size grows, the number of moves grows with the number of points on the surface.

Input Size (n)	Approx. Operations
10 x 10	100 moves
100 x 100	10,000 moves
1000 x 1000	1,000,000 moves

Pattern observation: Doubling the grid size in each direction quadruples the total moves.

Final Time Complexity

Time Complexity: O(n²)

This means the machining time grows with the square of the grid size, as the tool visits every point on the surface.

Common Mistake

[X] Wrong: "The time grows linearly with the number of points because the tool just moves once per point."

[OK] Correct: The total points come from two directions (X and Y), so the total moves multiply, causing quadratic growth.

Interview Connect

Understanding how nested loops affect machining time helps you explain efficiency in real CNC programming tasks.

Self-Check

"What if we used a single loop to follow a spiral path instead of a grid? How would the time complexity change?"