Description: Two dimensional convex hull, the difficulty in the algorithm, can solve many problems quickly
To Search:
- [dephidatabasedesigncourses.Rar] - database design courses, a library manag
- [CircleGiftWrap] - computational geometry, with VC point fo
- [hull] - a pretty good convex hull generation pro
- [expr3] - problem given a container, its length L,
- [ConvexHull] - The use of C++ Realize the Graham scan m
- [Delaunay2] - Delauny triangulation realize VC generat
- [a] - Given the coordinates of N points, and t
- [convex] - Image sub-block implementation procedure
File list (Check if you may need any files):
Download