Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Privacy-preserving computational geometry
open-in-new
<p>Privacy-preserving computational geometry is the research area on the intersection of the domains of <a href="/facts/Secure_multi-party_computation/7xJbbvIo">secure multi-party computation</a> (SMC) and <a href="/facts/Computational_geometry/eeaotQtl">computational geometry</a>. Classical problems of computational geometry reconsidered from the point of view of SMC include shape intersection, private point inclusion problem, <a href="/facts/Range_searching/Fkls9MD3">range searching</a>, <a href="/facts/Convex_hull/D4Id3JDS">convex hull</a>, and more. </p><p>A pioneering work in this area was a 2001 paper by Atallah and Du, in which the secure <a href="/facts/Point_in_polygon/acr2LQ1n">point in polygon</a> inclusion and polygonal intersection problems were considered. </p><p>Other problems are computation of the distance between two private points and secure two-party point-circle inclusion problem. </p>