Before revision:  We also explore emanation graphs of grade two, which may have twice the } number of edges , without increasing the spanning ratio. Exact methods of simplification along with mathematical proofs on properties of the simplified graph is provided. We compare simplified emanation graphs against Shewchuk's constrained Delaunay triangulations on both synthetic and real-life datasets.
After revision:  We also explore emanation graphs of grade two, which may have twice the } number of edges compared to grade one graphs. We introduce a method of simplification that makes it an interesting geometric graph to be used for network visualization and geometric routing. In particular, we compare simplified emanation graphs against Shewchuk's constrained Delaunay triangulations on both synthetic and real-life datasets.