Universal Sets of n Points for 1-bend Drawings of Planar Graphs with n Vertices
Résumé
This paper shows that any planar graph with n vertices can be point-set embedded with at most one bend per edge on a universal set of n points in the plane. An implication of this result is that any number of planar graphs admit a simultaneous embedding without mapping with at most one bend per edge.
Domaines
Géométrie algorithmique [cs.CG]| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...