I want to fill the clipped model in a simple way.
For every single list, sort the points on the list and connect the last point and the first one if it’s opened. Take the first point on the list and find its two neighboring points, construct a triangle by them.
I want to find the boundary of all projected points which are computed from the points on the 3D model. The red arrow in the following image represents the projected vector. I will project the original points on the 3D model to a plane.
Create two half spheres and save them in a vtp file by ParaView. We will use it to explore an algorithm that finds the two separated cut list and sort all points in every list. The original scene is like the following images. Use vtkCutter to create cut lines that Read more…
Create a sphere and clip it as the following image. We will pull down the boundary and close the opening to get a new model. How to pull down the boundary of the hemispheres? Step 1. Find all independent edges which are used by only one cell. Step 2. Connect Read more…
We often need to delete some elements in an STL set. But it causes a strange bug if we are careless sometimes. One newbie in C Plus Plus program language may write the following code to delete all odd numbers in a set. int main() { vector<int> vec{ 1, 3, Read more…
I want to get the solution of the equation Bisection Method The first algorithm for the problem is bisection method. The algorithm bisection method doesn’t require derivation for the equation. It just needs a possible solution range [l, r], then calculates the variable mid as , compares the result of Read more…
Driven class of unary_function can be used to check a single element based on special condition.Programmer can regard it as some algorithms’ parameter, such as count_if, find_if, and find_if_not.The following code shows how to write a customized unray class and use it. C++ struct Widget { int GetSpeed() const { return speed; } Widget( const Read more…
We need not sort all elements sometimes. Here are a few simple examples of STL algorithms partial_sort, nth_element, and partition. partial_sort For example, find the 5 biggest ones in 10 random numbers. #include <iostream> #include <vector> #include <cstdlib> #include <ctime> #include <algorithm> using namespace std; int main() { vector<int> values; Read more…
accumulate Interval algorithm accumulate supports custom calculate method to count elemeints in the special range. We can use it to get summary, multiple, average and etc of some elements, it’s very convenient and powerful. The syntax and usage example are in the following. Syntax: template< class InputIt, class T > Read more…