We show how to represent a simple polygon \u3ci\u3eP\u3c/i\u3e by a grid (pixel-based) polygon \u3ci\u3eQ\u3c/i\u3e that is simple and whose Hausdorff or Fréchet distance to \u3ci\u3eP\u3c/i\u3e is small. For any simple polygon \u3ci\u3eP\u3c/i\u3e, a grid polygon exists with constant Hausdorff distance between their boundaries and their interiors. Moreover, we show that with a realistic input assumption we can also realize constant Fréchet distance between the boundaries. We present algorithms accompanying these constructions, heuristics to improve their output while keeping the distance bounds, and experiments to assess the output
