Before revision:  We devise a fast  shortest path algorithm on arbitrary induced subgraphs of terrain visibility graphs and a polynomial-time algorithm for Dominating Set on special terrain visibility graphs (called funnel visibility graphs).
After revision:  We devise a fast output-sensitive shortest path algorithm on arbitrary induced subgraphs of terrain visibility graphs and a polynomial-time algorithm for Dominating Set on special terrain visibility graphs (called funnel visibility graphs).