We study inverse percolation on square, triangular, and honeycomb lattices by irreversibly removing tortuous k-mers from initially fully occupied substrates. Monte Carlo simulations and finite-size scaling are used to determine the inverse percolation threshold, θc,k, and characterize the critical behavior. The dependence of θc,k on the k-mer length is strongly substrate-dependent. On the honeycomb lattice, the threshold exhibits a nonmonotonic behavior, reaching a minimum at k=8, whereas on the square lattice the minimum occurs at k=4. In contrast, the threshold increases monotonically with k on the triangular lattice. This trend suggests that the minimum shifts toward shorter objects as the coordination number increases, eventually disappearing for the triangular lattice. The relative ordering of the three thresholds changes at large k, indicating that lattice robustness cannot be inferred from coordination number alone. Comparison with previously reported results for linear k-mers on square and triangular lattices further reveals that the geometry of the removed objects affects the evolution of connectivity and the location of the percolation threshold. The reported critical exponents ν, β and γ are consistent with standard two-dimensional percolation, suggesting that tortuous removal shifts the transition threshold without changing its universality class.