Before revision:  Our proof of this result is constructive and almost immediately implies that flat clustered planarity can be tested in polynomial time if a plane drawing of the cluster adjacency graph is given as a part of the input .
After revision:  Our proof of this result is constructive and almost immediately implies an efficient algorithm for testing if a given piecewise linear map of a graph in a surface is approximable by an embedding .