Algorithm
Find Closest Plane Between Points In 3D By Levmar Algorithm
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.
CGAL
Find Closest Line Between Points In 2D By Least Squares
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.
VTK
Simple Way To Fill The Hole On 3D Model
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.
VTK
VTK : Find The Boundary Of Projected Points
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.
VTK
VTK – Find Connected Lists And Sort All Points In Them
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…
VTK
VTK – Stretch The Boundary And Fill The Hole
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…
Algorithm
CPP – Delete Special Elements In Vector
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…
Algorithm
Python & Algorithm – Equation Solving
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…
Algorithm
CPP – Driven Class Of unary_function
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…