Embedding a Planar Graph on a Given Point Set
A point-set embedding of a planar graph G with n vertices on a set S of n points is a planar straight-line drawing of G, where each vertex of G is mapped to a distinct point of S. We prove that the point-set embeddability problem is NP-complete for 3-connected planar graphs, answering a question of...
| Main Author: | |
|---|---|
| Other Authors: | |
| Published: |
Springer-Verlag Berlin
2012
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1993/8869 |