![]() ![]() Even the tessellation algorithms, which can as much as quadruple the size of the meshes, operate locally, vertex by vertex, so they are order-of-n algorithms. It's convenient for the programmer, but may be sluggish for the user.Īlthough some methods can be a bit slow, none of them are non-linear in the amount of time they take. This is very useful for some modifiers, but requires far more memory and processing time than an equivalent normal mesh. MNMesh has a winged-edge structure and a highly interlinked topology. All methods of this class are implemented by the system. It is not suitable for use as a pipeline object. ![]() It has certain capabilities, such as the ability to recognize faces with more than 3 sides, that are useful in some applications. The MNMesh class is provided for temporary use by plug-ins, to help with complex topology-based modifications to Meshes.
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |