An integral embedding of a graph is a straight line embedding whose edges have integer lengths. Under this topological definition, the vertices occupy distinct points and the edges meet only at common endpoints. In the plane, this is called a plane integral drawing (Kemnitz and Harborth 2001).
Some geometric literature also uses integral embedding for any integral drawing. In that usage, the integer edge-length condition does not prevent intersections, so the resulting drawing need not be a topological embedding.
