The pseudolinear crossing number of a graph 
, denoted 
, is the minimum number of pairwise crossings
in a pseudolinear drawing of 
(Hernández-Vélez et al. 2017, Schaefer
2026). A drawing is pseudolinear if its edges can be
extended to a pseudoline arrangement in which each
pseudoline contains exactly one graph
edge of the drawing.
Every rectilinear drawing is pseudolinear, and pseudolinear drawings form a restricted class of graph drawings. Therefore
 |
where 
is the graph crossing number and 
is the rectilinear
crossing number. Deciding whether the pseudolinear crossing number of a graph
is at most a given integer is NP-complete
(Hernández-Vélez et al. 2017).
