Description: This method of Convex Hull is always counter-clockwise order, can be used for any simple polygon.
To Search:
- [ConvexHull1] - Graham method for convex hull of the C p
- [ConvexHull2] - generate incremental algorithm using con
- [ipgrab-08.2] - The procedure is similar to tcpdump soft
- [contexhull] - TUKE.txe document is 200 discrete points
- [FillScaning] - with polygon filling algorithm an arbitr
- [AD9851] - 12-bit AD conversion program, great. !!!
- [LiSanDelaunay] - Generating the Convex Hull of a discrete
- [convex-hull] - This code computes the 3D convex hull of
File list (Check if you may need any files):