5 results about "Embedding algorithm" patented technology

An embedding is 2- cell if each face is equivalent to an open disk. Efficient embedding algorithms for the plane are well-known. By Kuratowski's Theorem, a non-planar graph G contains a subdivision of K 5 or K 3,3 as a subgraph. The objective of this thesis is to devise efficient practical embedding algorithms for the projective plane and torus.