A Convex Hull Algorithm for Planar Point Set Based on Privacy Protecting
Qiang Wang, Yuanping Zhang · 2009
Research on secure multi-party computation is of great interest in the field of information security. To determine convex hull algorithm for planar point set or polygons may be applied in a large number of research fields, and at present, there are a lot of methods to solve this problem. In this paper, a protocol is schemed out to determine a line by two secret points. The method is applied to determine the whole convex hull of two secret planar point sets. The corresponding security and complexity are analysed.