1
2
我不想再去猜测人们的意图,但是如果你只是想摆脱玛雅,你可以从一开始就提取玛雅的三角测量。
(The corresponding normals and vertex colours are straightforwardly accessible. UVs require a little more effort -- I don't remember the details (all my Maya code is with my ex employer) but whilst at first glance it may seem like you don't have the data, in fact it's all there, just not conveniently.)
(另一个注意事项——如果您的艺术家足够努力,他们可以创建当
如果不想使用API或python,那么运行
This is a bit hacky, but you're guaranteed to get the exact triangulation Maya is using. Rather easier than writing your own triangulation code, and almost certainly a LOT easier than trying to work out whatever Maya does internally... |
2
1
Jonathan Shewchuk has a very popular 2D triangulation tool called Triangle, and a 3D version should appear soon. He also has a number of papers on this topic that might be of use. |
3
1
你可以试试看 Voronoi and Delaunay Techniques by Henrik Zimmer. I don't know if it's what Maya uses, but the paper describes some common techniques. |
4
0
Here you can find an applet that demonstrates the Incremental, Gift Wrap, Divide and Conquer and QuickHull algorithms computing the Delaunay triangulation in 3D. Pointers to each algorithm are provided. |
guorui · 如何绘制这样的图形? 6 年前 |
Stéphane Laurent · 从POV射线到rgl 6 年前 |
sab ambrose · 存储网格数据值 6 年前 |
Unis · Gmsh中的“几乎结构化”二维四边形网格 7 年前 |
user1255410 · 生成外凸多边形 7 年前 |
AmirB · CGAL曲面网格-删除面 7 年前 |
praveen kr · 找出一个点属于哪个四面体元素 7 年前 |
mathew7k5b · 如何检测选定顶点是否位于三角形网格的边界上? 7 年前 |