Drawings of graphs on surfaces with few crossings

We give drawings of a complete graphK_n withO(n⁴ log²g/g) many crossings on an orientable or nonorientable surface of genusg 2. We use these drawings ofK_n and give a polynomial-time algorithm for drawing any graph withn vertices andm edges withO(m² log²g/g) many crossings on an orientable or nonorientable surface of genusg 2. Moreover, we derive lower bounds on the crossing number of any graph on a surface of genusg 0. The number of crossings in the drawings produced by our algorithm are within a multiplicative factor ofO(log²g) from the lower bound (and hence from the optimal) for any graph withm 8n andn²/m g m/64.The research of the third and the fourth authors was partially supported by Grant No. 2/1138/94 of the Slovak Academy of Sciences and by EC Cooperative action IC1000 Algorithms for Future Technologies (Project ALTEC). A preliminary version of this paper was presented at WG93 and published in Lecture Notes in Computer Science, Vol. 790, 1993, pp. 388–396.