Summary: We introduce the concept of comprehensive triangular decomposition (CTD) for a parametric polynomial system $F$ with coefficients in a field. In broad words, this is a finite partition of the the parameter space into regions, so that within each region the “geometry” (number of irreducible components together with their dimensions and degrees) of the algebraic variety of the specialized system $F(u)$ is the same for all values $u$ of the parameters. We propose an algorithm for computing the CTD of $F$. It relies on a procedure for solving the following set theoretical instance of the coprime factorization problem. Given a family of constructible sets $A _{1}, \dots , A _{s }$, compute a family $B _{1}, \dots , B _{t }$ of pairwise disjoint constructible sets, such that for all $1 \leq i \leq s$ the set $A _{i }$ writes as a union of some of the $B _{1}, \dots , B _{t }$ . We report on an implementation of our algorithm computing CTDs, based on the RegularChains library in Maple. We provide comparative benchmarks with Maple implementations of related methods for solving parametric polynomial systems. Our results illustrate the good performances of our CTD code.