Generate a new polyData which has not invalid point. We have to colloct the points that are used by cells and update the point ids in the cell lists. I used binary search algorithm to speed up the process.
We have to find all edges and judge whether the point is in the circumscribed sphere of another three points, the target edge is used by two cells, it has only one neighbor cell in the other words. Finally, flip the cells as the above image.
But the result of the cutting is not particularly idealistic.
So we have to increase density necessarily.
The left one is the low density model, the right attachment model has higher density in the following image.
The affine transform in the 3D world can be represented by a 4×4 matrix. If there is no scale in the affine transform, the vector is translate vector and A is the rotate matrix. The original point’s position is representing by M, the changed point’s position is M’. Read more…
Calculate Rotate Angle And Asix Between Two Vectors, Calculate Model’s Size In Local Coordinate System, Boolean Operation For Mesh, Found Intersection Circle Of Two Models.
the action scale works in the three directions axis X, axis Y and asix Z. So the scaling transform I want to create needs to rotate by 45 degrees around asix Z, then apply scale(2, 1, 1). But the new transform will rotate cube surely. How to scale the cube without rotating or translating it?
I found a strange result about transform computation in my project. I create a new transform B by A, then use A to deep copy B and print it. There is a different matrix if I use shallow copy for A.Turn on the Warning Display setting for vtkTransform object. I Read more…
how to find the closest plane closest to a few random points in the 3D environment. We know that the sum of square distances from point to plane can be calculated.
Let’s create a few random points and use algorithm library CGAL and the visualization toolkit (VTK) to find and draw the closest line by a demo.