A good drawing of a finite simple graph is a graph drawing in the plane in which every pair of distinct edges meets at most once, either at a common endpoint or at a proper graph crossing, and no three edges meet away from vertices (Schaefer 2018, p. 4). In particular, adjacent edges meet only at their common endpoint, and edges without a common endpoint cross at most once.
A good drawing is also called a simple drawing (Arroyo et al. 2023, p. 745). The convention excluding three edges from crossing at one point is sometimes omitted from the definition of a simple drawing (Arroyo et al. 2023, p. 746).
The graph crossing number of a finite simple graph can be attained by a good drawing. Self-crossings,
crossings of adjacent edges, and repeated crossings
of two edges can be removed by rerouting edges
to reduce the number of graph crossings (Schaefer
2018, p. 5). However, a good drawing need not minimize that number. For example,
the straight line drawing of the complete
graph 
with its vertices at the corners of a square
is good and has one graph crossing, although 
is a planar
graph.
