Abstract: We study vertex sparsification for preserving distances in planar graphs. Given an edge-weighted planar graph with k terminals, the goal is to construct an emulator, which is a smaller ...