8. In judging whether a convex polygon 9. Find points of GRAHAM algorithm 10. Find point set of convex hull volume parcels Act 11. Line judge whether the polygon 12. Seeking simple polygon focus 13. Convex Polygon focus 14. For sure in a given polygon within the a point 15. demand from outside the p... Special EffectsVisual C++
The use of C++ Realize the GRAHAM scan method (for solving convex hull problems), can be set to generate a random number of points, patterns, and at the same time to support the set display range, display algorithm processing time and the use of document features such as import and export points. (F... AlgorithmVisual C++
Collection of classical computational geometry algorithms, including the rotating卡壳for convex hull, and center of gravity, polygon area, polygon perimeter, linear equations, etc.... Special EffectsVisual C++
Computational geometry (C described) in the second edition of materials matching procedures, using C language to achieve the book... Special EffectsC++