%0 PDF %T Recognizing Weak Embeddings %A Akitaya, Hugo. %D 2018-10-09T07:38:27.197-04:00 %8 2018-10-09 %R http://localhost/files/td96kd897 %X Abstract: An \emph{embedding} of a graph $G$ is a drawing $\varphi:G\rightarrow M$ of $G$ on a surface $M$ such that every vertex in $V(G)$ is mapped to a distinct point and edges in $E(G)$ to interior-disjoint Jordan arcs between the corresponding vertices. A \emph{weak embedding} is a map $\varphi:G\rightarrow M$ such that, for every $\varepsilon>0$, there exists an embedding $\psi_\varepsilon:G\rightarrow M$ so that $\|\varphi-\psi_\varepsilon\|; Thesis (Ph.D.)--Tufts University, 2018.; Submitted to the Dept. of Computer Science.; Advisor: Diane Souvaine.; Committee: Csaba Tóth, Erik Demaine, Greg Aloupis, and Lenore Cowen.; Keyword: Computer science. %[ 2022-10-11 %9 Text %~ Tufts Digital Library %W Institution