This website requires JavaScript.
Explore
Help
Sign In
penguincoder
/
convexhull
Archived
Watch
1
Star
0
Fork
You've already forked convexhull
0
Code
Issues
Pull Requests
Releases
Wiki
Activity
This program will find the smallest polygon that will encircle a set of points in a coordinate plane
This repository has been archived on
2020-05-27
. You can view files and clone it, but cannot push or open issues/pull-requests.
1
Commit
1
Branch
0
Tags
3
KiB
C++
55.6%
Java
42.8%
Makefile
1.6%
master
Go to file
HTTPS
Download ZIP
Download TAR.GZ
Download BUNDLE
Clone in VS Code
Cite this repository
APA
BibTeX
Cancel
mercury
f3fd11ac6a
Initial revision
2003-12-03 17:36:36 +00:00
GeneratePoints.java
Initial revision
2003-12-03 17:36:36 +00:00
Makefile
Initial revision
2003-12-03 17:36:36 +00:00
PlotConvexHull.java
Initial revision
2003-12-03 17:36:36 +00:00
hull.cpp
Initial revision
2003-12-03 17:36:36 +00:00
hullcomp.java
Initial revision
2003-12-03 17:36:36 +00:00