Tile-Based Rasterization

Write a C program that implements tile-based triangle assignment.

Requirements:

• Define a screen of 32x32 pixels divided into 4x4 tiles (each tile is 8x8 pixels)
• Define three triangles: T1: (2,2), (10,4), (6,12) — small triangle in upper-left T2: (15,15), (25,15), (20,25) — triangle in center T3: (28,28), (31,28), (30,31) — tiny triangle in bottom-right corner
• For each triangle:
  • Compute its bounding box (min_x, min_y, max_x, max_y)
  • Determine which tiles the bounding box intersects
  • For each candidate tile, perform a coarse overlap test: check if the triangle's bounding box overlaps the tile
  • Print the list of tile coordinates (tile_x, tile_y) that the triangle touches
• Print a map for each triangle showing which tiles are touched (use 'X' for touched, '.' for empty)
• Calculate and print the efficiency gain: what percentage of the screen did NOT need per-pixel processing for each triangle?
• Include a note about why tile-based rendering is especially important for mobile GPUs