Classical problems of computational geometry reconsidered from the point of view of SMC include shape intersection, private point inclusion problem, range searching, convex hull,[1] and more.
[2] A pioneering work in this area was a 2001 paper by Atallah and Du,[3] in which the secure point in polygon inclusion and polygonal intersection problems were considered.
Other problems are computation of the distance between two private points[4] and secure two-party point-circle inclusion problem.
[5] The problems use the conventional "Alice and Bob" terminology.
In all problems the required solution is a protocol of information exchange during which no additional information is revealed beyond what may be inferred from the answer to the required question.