You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Thank you for sharing the your wonderful work C2A on Github.
I have tested several toy examples like cubes and spheres, and found out that when the inputs are two cubes(with 12288 faces), the computational overhead is extremely high(~37ms), compared to that of two spheres(with 74240 faces) which only takes ~2.6ms.
Is it normal? And if not, is there any way to improve this situation?
Best regards,
Gordon
The text was updated successfully, but these errors were encountered:
Dear Tang,
Thank you for sharing the your wonderful work C2A on Github.
I have tested several toy examples like cubes and spheres, and found out that when the inputs are two cubes(with 12288 faces), the computational overhead is extremely high(~37ms), compared to that of two spheres(with 74240 faces) which only takes ~2.6ms.
Is it normal? And if not, is there any way to improve this situation?
Best regards,
Gordon
The text was updated successfully, but these errors were encountered: