Before revision:  In this work we study graph burning on geometric graphs and show NP-completeness results on several sub classes. More precisely, we show burning problem to be NP-complete on interval graph, permutation graph and disk graph .
After revision:  In this article we show burning problem to be NP-complete on interval graph, permutation graph and disk graph .