Approximate Convex Hullse
In thie field of privacy-preserving computational geometry, the convex hulls problem is very important. I developed an alogrithm that can solve the problem in an efficient way while more private information is concealed. We use Reference Point to construct the approximate convex hull
Our algorithm can hide the points on the vertex of the convex hull.
Pictures to illustrate our algorithm and an example of our simulation
 |
 |
| The usage of reference point | Get the approximate convex hull from two private convex polygons | 
| 
|
| Get the approximate intersecited polygon from two private polygons | An example of our simulation. |
Expriemnt source code
Generating 2D convex hull: Convex.zip
Generating Approximate 2D convex hull: AConvex.zip
MFC Demo for Approximate 2D convex hull: 2D-Demo.zip