Prefer a chat interface with context about you and your work?
IMPROVED ALGORITHMS FOR THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE 3-TREES
In the point-set embeddability problem, we are given a plane graph G with n vertices and a point set S with the same number of points. Now the goal is to answer the question whether there exists a straight-line drawing of G such that each vertex is represented as a …