Complexity

• O(slogs), not O(klogk), where s is the number of face cluster hierarchies.
• s << k
• Almost always, s << n
• Each face cluster hierarchy represents a separate polygon mesh

Previous slide

Next slide

Back to first slide

View graphic version