An \$O(n sup 1.5 log n)\$-time algorithm is given for finding a maximum number of non-intersecting segments among \$n\$ horizontal and vertical line segments.