Which clipping algorithm can handle convex and concave polygons efficiently?

$-$ A$)$ Cohen$-$Sutherland

$-$ B$)$ Liang$-$Barsky

$-$ C$)$ Sutherland$-$Hodgman

$-$ D$)$ Weiler$-$Atherton