Privacy-preserving computational geometry

Privacy-preserving computational geometry is the research area on the intersection of the domains of secure multi-party computation (SMC) and computational geometry. Classical problems of computational geometry reconsidered from the point of view of SMC include shape intersection, private point inclusion problem, range searching, convex hull, and more.

Source: Wikipedia — Privacy-preserving computational geometry (CC BY-SA 4.0)