Rotate Vector To Orthogonal Direction Just like in the picture, we will rotate vector to which is orthogonal to the neighbor . The vector is the cross product of and . #include <iostream> #include “point.hpp” int main() { Point m( 1, 0, 0 ); Point n( 1, 0.5, 0 ); Read more…
The article shows how to combine two mesh objects to one based on VTK. The code snippet is in the following part. #include <iostream> #include <vtkSmartPointer.h> #include <vtkSphereSource.h> #include <vtkActor.h> #include <vtkConeSource.h> #include <vtkRenderer.h> #include <vtkRenderWindow.h> #include <vtkPolyDataMapper.h> #include <vtkRenderWindowInteractor.h> #define vtkPtr( var, className ) vtkSmartPointer<className> var = \ vtkSmartPointer<className>::New() Read more…
Add subdirectories and use VTK library and Qt in my projects. The file structure looks like the following image. projectB generates lib and dll files which will be used by projectA. projectA show a window and print message from Base class in projectB. The file CMakeLists.txt in the root directionary Read more…
We will compute the distance to the sphere for every point. Write the distance value to point data as scalars. Set different colors for the different distance ranges.
The angle between two vectors can be calculated by the dot product. We want to find the direction of the rotation. Here are two different ways to get it done. 1、Compute the value of Sine of the angle, then we can judge it’s clockwise or counterclockwise. The value of Sine Read more…
Here is a way to remesh 3D model, for every edge we can add a few points on it and create new small cells. The old big triangle will be removed from the model.
Here is a way to increase density for the 3D model, for every triangle cell we can add a center point and create 3 new small cells. The old big triangle will be removed from the model. You can read other relative posts about changing cells.
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.