Graph based topological analysis of tessellated surfaces
SM '03 Proceedings of the eighth ACM symposium on Solid modeling and applications
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |
It is shown that the problem of determining whether two 2-complexes are homeomorphic is isomorphism-complete.