Home Search - triangulation hole
Search - triangulation hole - List
- BMyCrust take as input a 3D scatter points cloud and return a tight, manifold, triangulation.
Remember that crust algorithm needs a cloud representing a volume, so open surface may give inaccurate results. For example : a plane can not be triangulated, half-sphere is in doubt, a sphere with a small hole shoud be good.
The more points are given the best the surface will be fitted, of course in this case you would have to wait more and in the worst case a memory help error may occurs. The best results are obtained with more points in high curvature feature.
The old version did not ensure the output surface to be a manifold so it could be used only for graphical purpose. In the new one a tight, regular manifold is returned. It as outward normals orientation, after using this algorithm is very easy to get an STL file from a point cloud.
I added a manifold extraction tool that also correct the errors (slivers) generated by delaunayn during the initial tessellation.-BMyCrust take as input a 3D scatter points cloud and return a tight, manifold, triangulation.
Remember that crust algorithm needs a cloud representing a volume, so open surface may give inaccurate results. For example : a plane can not be triangulated, half-sphere is in doubt, a sphere with a small hole shoud be good.
The more points are given the best the surface will be fitted, of course in this case you would have to wait more and in the worst case a memory help error may occurs. The best results are obtained with more points in high curvature feature.
The old version did not ensure the output surface to be a manifold so it could be used only for graphical purpose. In the new one a tight, regular manifold is returned. It as outward normals orientation, after using this algorithm is very easy to get an STL file from a point cloud.
I added a manifold extraction tool that also correct the errors (slivers) generated by delaunayn during the initial tessellation.
Update : 2025-04-08 Size : 5.76mb Publisher : naz - linux下三角化程序，可以实现带洞矩阵三角化。gcc语言编写-under linux triangulation process can be achieved with the hole matrix triangulation. the preparation of the gcc language
Update : 2025-04-08 Size : 138kb Publisher : wanglinbo - c语言三角化例子，实现带洞矩形的三角化。-c language triangulation example, with a hole rectangular triangulation.
Update : 2025-04-08 Size : 16kb Publisher : wanglinbo - 这是一个提供二维区域Delaunay三角形剖分的 C语言程序。能够对于由折线围成的多空洞、多介质区域，生成指定局部加密的Delaunay三角形剖分。-This is a two-dimensional region to provide Delaunay triangulation of the C language program. The broken line surrounded by long and short hole, multi medium region, generating the specified Delaunay triangulation encryption local branch.
Update : 2025-04-08 Size : 13kb Publisher : laogu - 迭代划分三角形网络，包括圆形、方形、圆形有孔、不规则实例-Iterative triangulation network, including circular, square, circular hole, irregular examples
Update : 2025-04-08 Size : 2.05mb Publisher : YinKate - 划分二维图形，形成任意网格及密度，带有圆形、方形、方形圆孔-Iterative triangulation network, including circular, square, circular hole, irregular examples
Update : 2025-04-08 Size : 518kb Publisher : YinKate