A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Dynamic Planar Embeddings of Dynamic Graphs
[article]
2017
arXiv
pre-print
We present an algorithm to support the dynamic embedding in the plane of a dynamic graph. An edge can be inserted across a face between two vertices on the face boundary (we call such a vertex pair linkable), and edges can be deleted. The planar embedding can also be changed locally by flipping components that are connected to the rest of the graph by at most two vertices. Given vertices u,v, linkable(u,v) decides whether u and v are linkable in the current embedding, and if so, returns a list
arXiv:1704.00565v1
fatcat:6wz7is7eyfedlpybdxnjuqrhvy