Introduction - If you have any usage issues, please Google them yourself
on various geometric algorithm. In terms of geometry library functions (lines intersect, size, etc.) for convex hull graham scanning judgment and whether the polygon. Both contain some tests
Packet : 33753156geometry_algorithm.rar filelist
计算几何学\GEOMETRY.H
计算几何学\GRAHAM.CPP
计算几何学\GRAHAM.ICC
计算几何学\GRAHAM.IN
计算几何学\GRAHAM.IRS
计算几何学\GRAHAM.OUT
计算几何学\GRAHAM.SOL
计算几何学\InsidePolygon.in
计算几何学\InsidePolygon.out
计算几何学\Inside_Polygon.cpp
计算几何学\intersect.cpp
计算几何学\intersect.in
计算几何学\intersect.out
计算几何学\POLYGON.CPP
计算几何学\POLYGON.IN
计算几何学\POLYGON.OUT
计算几何学\TEST.CPP
计算几何学\TEST.IN
计算几何学\TEST.OUT
计算几何学\test_geometry.cpp
计算几何学