Before revision:  Our algorithm runs in O(n ) time. The best previously known algorithm for this problem runs in O(n^2) time .
After revision:  Moreover, we provide an optimal \Theta(n \log n)-time algorithm to compute all valid removal directions for polyhdera that are castable with a single-part mold. Both algorithms are an improvement by a linear factor over the previously best known algorithms for both of these problems .