I'm looking for a planar graph embedding algorithm description. Actually, it would be nice if I knew at least names of these algorithms. The only one I know is called γ(gamma)-algorithm, and it has an only description in only one book(in Russian, so I don't even know English name of this algorithm), but I guess it's not the only one. Googling haven't given me any sufficient results too.
The book Planar Graphs: Theory and Applications by T. Nishizeki and N. Chiba (Dover Press) has a discussion both of planarity testing and embedding algorithms.