Is doubly-connected edge list a good data-structure for planar graph which vertices can be moved freely?
I experienced DCEL as a very good structure when it comes to add/delete some vertex or edge. And I can detect all faces easily too. But when I start to move vertices of the graph it can happen that the graph is no longer valid.
Am I forced to reconstruct my whole graph from scratch every time I move one of vertices, because I could screw the topology of the graph?
Or is there any better data-structure for this purpouses?