No self-introduction
Loading
Profile
Follow
codes (1)
Constrained Delaunay segmentation
1.0
Delaunay triangulation of point set with inner boundary constraint is a basic problem in many fields, such as finite element analysis, computer graphics and realistic graphics. Based on the existing algorithms, Delaunay triangulation of scattered data with inner boundary constraint is realized by inserting midpoint to restore constraint boundary
tansuozhe~ 1 0
1
No more~
Follows0
Fans0