In the following I will use definitions and constructions of simplicial complexes and $\Delta$-complexes/sets from Greg Friedman's An elementary illustrated Introduction to simplicial sets.
I'm looking for an example of a $\Delta$-complex which cannot be endowed with structure of a simplicial complex or a proof that it always works. In this case one should say this space is "triangulable".
Note that of course it's easy to construct a $\Delta$-complex which isn't a simplicial complex with respect the choices of simplices comming from the $\Delta$-complex datum: see example on page 11 in Friedman's notes. And this should be not surprising at all because $\Delta$-complexes allow much more flexibility in gluing boudaries than simplicial complex. But that's not what I'm asking about: if we subdivide the $2$-cell in tree new $2$-cells, then we can endow this $\Delta$-complex with another simplex structure which turns it into a honest simplicial complex.
And so my question is if every $\Delta$-complex "triangulable" in the sense that one can endow it with structure of a simplicial complex (ie decompose it into simplices satisfying glueing relations allowed for simplicial complex) which might have nothing to do with original $\Delta$-complex structure?
Supplemental picture:
