We design algorithms to efficiently evaluate genus 2 modular polyno-mials of Siegel and Hilbert type over number fields, using complex approximations. Under heuristics related to the computation of theta functions in quasi-linear time, the output is provably correct. Our algorithms also apply to finite fields via lifting.