Laser triangulation is often used for industrial quality control. In this context, the main issues are temporal performance, embedded suitability and precision. Laser line detection is the key step in laser triangulation. Several laser line detection algorithms were developed on the last decades. The object of this paper is to study the suitability of these algorithms towards the cited problematics. To reach this goal, we updated the algorithms precision comparison with some recent algorithms, we analyzed the execution time of these algorithms, and we studied the complexity of the algorithms to judge their adequacy toward embedded constraints. Analysis shows that none of the algorithms are perfect, so the choice is a compromise between precision, computation resources needs and execution time.